/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:33:09,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:33:09,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:33:09,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:33:09,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:33:09,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:33:09,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:33:09,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:33:09,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:33:09,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:33:09,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:33:09,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:33:09,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:33:09,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:33:09,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:33:09,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:33:09,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:33:09,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:33:09,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:33:09,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:33:09,753 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:33:09,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:33:09,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:33:09,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:33:09,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:33:09,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:33:09,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:33:09,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:33:09,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:33:09,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:33:09,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:33:09,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:33:09,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:33:09,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:33:09,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:33:09,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:33:09,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:33:09,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:33:09,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:33:09,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:33:09,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:33:09,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:33:09,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:33:09,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:33:09,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:33:09,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:33:09,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:33:09,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:33:09,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:33:09,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:33:09,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:33:09,788 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:33:09,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:33:09,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:33:09,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:33:09,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:33:09,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:33:09,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:09,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:33:09,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:33:09,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:33:09,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:33:09,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:33:09,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:33:09,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:33:09,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:33:10,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:33:10,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:33:10,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:33:10,014 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:33:10,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2022-04-27 12:33:10,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96de105bd/db0813609d7b46b29f8dc5d94d4e3202/FLAGde86dcbe4 [2022-04-27 12:33:10,491 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:33:10,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2022-04-27 12:33:10,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96de105bd/db0813609d7b46b29f8dc5d94d4e3202/FLAGde86dcbe4 [2022-04-27 12:33:10,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96de105bd/db0813609d7b46b29f8dc5d94d4e3202 [2022-04-27 12:33:10,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:33:10,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:33:10,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:10,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:33:10,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:33:10,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:10" (1/1) ... [2022-04-27 12:33:10,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ed59cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:10, skipping insertion in model container [2022-04-27 12:33:10,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:10" (1/1) ... [2022-04-27 12:33:10,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:33:10,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:33:11,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2022-04-27 12:33:11,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:11,139 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:33:11,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2022-04-27 12:33:11,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:11,183 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:33:11,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11 WrapperNode [2022-04-27 12:33:11,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:11,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:33:11,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:33:11,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:33:11,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:33:11,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:33:11,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:33:11,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:33:11,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (1/1) ... [2022-04-27 12:33:11,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:11,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:33:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:33:11,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:33:11,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:33:11,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:33:11,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:33:11,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:33:11,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:33:11,316 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:33:11,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:33:11,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:33:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:33:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:33:11,403 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:33:11,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:33:11,567 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:33:11,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:33:11,573 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:33:11,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:11 BoogieIcfgContainer [2022-04-27 12:33:11,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:33:11,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:33:11,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:33:11,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:33:11,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:33:10" (1/3) ... [2022-04-27 12:33:11,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d290a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:11, skipping insertion in model container [2022-04-27 12:33:11,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:11" (2/3) ... [2022-04-27 12:33:11,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d290a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:11, skipping insertion in model container [2022-04-27 12:33:11,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:11" (3/3) ... [2022-04-27 12:33:11,582 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound5.i [2022-04-27 12:33:11,594 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:33:11,595 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:33:11,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:33:11,658 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62fea9b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@724d97d1 [2022-04-27 12:33:11,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:33:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:33:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:33:11,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:11,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:11,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-27 12:33:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090640363] [2022-04-27 12:33:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:33:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:11,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-27 12:33:11,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:33:11,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:33:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:33:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:11,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:33:11,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:33:11,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:33:11,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:33:11,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:33:11,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-27 12:33:11,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 12:33:11,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-27 12:33:11,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-27 12:33:11,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-27 12:33:11,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {33#true} is VALID [2022-04-27 12:33:11,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 12:33:11,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 12:33:11,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 12:33:11,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-27 12:33:11,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-27 12:33:11,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:33:11,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 12:33:11,945 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-27 12:33:11,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 12:33:11,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 12:33:11,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 12:33:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:33:11,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090640363] [2022-04-27 12:33:11,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090640363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:11,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:11,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7450315] [2022-04-27 12:33:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:33:11,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:11,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:12,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:12,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:12,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:12,031 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:12,157 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-27 12:33:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:33:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:33:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 12:33:12,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 12:33:12,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:12,282 INFO L225 Difference]: With dead ends: 51 [2022-04-27 12:33:12,282 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 12:33:12,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:12,288 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:12,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 12:33:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 12:33:12,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:12,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:33:12,317 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:33:12,317 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:33:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:12,322 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:33:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:12,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:12,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:12,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 12:33:12,323 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 12:33:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:12,327 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 12:33:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:12,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:12,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:12,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:12,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:33:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 12:33:12,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-27 12:33:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:12,332 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 12:33:12,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 12:33:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 12:33:12,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:12,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:12,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:33:12,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-27 12:33:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:12,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958460103] [2022-04-27 12:33:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:12,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:12,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791542298] [2022-04-27 12:33:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:12,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:12,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:33:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:12,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:33:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:12,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:12,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2022-04-27 12:33:12,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {195#true} is VALID [2022-04-27 12:33:12,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:33:12,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #84#return; {195#true} is VALID [2022-04-27 12:33:12,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2022-04-27 12:33:12,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {195#true} is VALID [2022-04-27 12:33:12,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {195#true} is VALID [2022-04-27 12:33:12,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} ~cond := #in~cond; {195#true} is VALID [2022-04-27 12:33:12,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#true} assume !(0 == ~cond); {195#true} is VALID [2022-04-27 12:33:12,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-27 12:33:12,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {195#true} {195#true} #78#return; {195#true} is VALID [2022-04-27 12:33:12,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:12,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:12,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:12,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:12,957 INFO L272 TraceCheckUtils]: 15: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:12,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:12,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {196#false} is VALID [2022-04-27 12:33:12,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-27 12:33:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:33:12,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958460103] [2022-04-27 12:33:12,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:12,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791542298] [2022-04-27 12:33:12,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791542298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:12,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:33:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564108177] [2022-04-27 12:33:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-27 12:33:12,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:12,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:12,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:12,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:33:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:33:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:33:12,990 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:13,212 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 12:33:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:33:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-27 12:33:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:33:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:33:13,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:33:13,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:13,269 INFO L225 Difference]: With dead ends: 37 [2022-04-27 12:33:13,270 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:33:13,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:33:13,271 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:13,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:33:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:33:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 12:33:13,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:13,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:13,281 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:13,281 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:13,284 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:33:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:13,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:13,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:13,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:33:13,285 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:33:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:13,288 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 12:33:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:13,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:13,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:13,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:33:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 12:33:13,291 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-27 12:33:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:13,291 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 12:33:13,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 12:33:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:33:13,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:13,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:13,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:13,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:13,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-27 12:33:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:13,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120357500] [2022-04-27 12:33:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:13,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:13,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993394634] [2022-04-27 12:33:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:13,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:13,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:13,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:33:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:13,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:33:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:13,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:14,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 12:33:14,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {425#true} is VALID [2022-04-27 12:33:14,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 12:33:14,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-27 12:33:14,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-27 12:33:14,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2022-04-27 12:33:14,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {425#true} is VALID [2022-04-27 12:33:14,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} ~cond := #in~cond; {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:33:14,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:14,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:14,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {455#(not (= |assume_abort_if_not_#in~cond| 0))} {425#true} #78#return; {462#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 12:33:14,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 5)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {473#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {473#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {480#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {480#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {480#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:33:14,075 INFO L272 TraceCheckUtils]: 17: Hoare triple {480#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:14,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:14,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 12:33:14,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 12:33:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:33:14,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:33:14,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-27 12:33:14,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {491#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-27 12:33:14,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {487#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {491#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:14,561 INFO L272 TraceCheckUtils]: 17: Hoare triple {507#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {487#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:14,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {507#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:14,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {514#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {507#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:33:14,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {514#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:33:16,571 WARN L290 TraceCheckUtils]: 13: Hoare triple {521#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {514#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 12:33:16,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {521#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} assume !false; {521#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} is VALID [2022-04-27 12:33:16,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {521#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} is VALID [2022-04-27 12:33:16,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {425#true} {425#true} #78#return; {425#true} is VALID [2022-04-27 12:33:16,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 12:33:16,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#true} assume !(0 == ~cond); {425#true} is VALID [2022-04-27 12:33:16,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} ~cond := #in~cond; {425#true} is VALID [2022-04-27 12:33:16,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {425#true} is VALID [2022-04-27 12:33:16,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2022-04-27 12:33:16,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-27 12:33:16,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-27 12:33:16,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-27 12:33:16,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {425#true} is VALID [2022-04-27 12:33:16,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-27 12:33:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:33:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120357500] [2022-04-27 12:33:16,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993394634] [2022-04-27 12:33:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993394634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:33:16,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:33:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2022-04-27 12:33:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245081071] [2022-04-27 12:33:16,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:33:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-04-27 12:33:16,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:16,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:18,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:18,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:33:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:33:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:33:18,681 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:26,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:29,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:32,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:35,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:38,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:41,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:43,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:45,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:33:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:46,166 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2022-04-27 12:33:46,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:33:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-04-27 12:33:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-27 12:33:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-27 12:33:46,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2022-04-27 12:33:48,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:48,524 INFO L225 Difference]: With dead ends: 64 [2022-04-27 12:33:48,524 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 12:33:48,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:33:48,526 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 24 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:48,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 146 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 226 Invalid, 8 Unknown, 0 Unchecked, 19.9s Time] [2022-04-27 12:33:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 12:33:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 12:33:48,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:48,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:33:48,552 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:33:48,553 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:33:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:48,556 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-27 12:33:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-27 12:33:48,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:48,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:48,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 58 states. [2022-04-27 12:33:48,557 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 58 states. [2022-04-27 12:33:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:48,560 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-27 12:33:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-27 12:33:48,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:48,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:48,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:48,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:33:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-27 12:33:48,565 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 21 [2022-04-27 12:33:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:48,565 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-27 12:33:48,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:33:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 12:33:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:33:48,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:48,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:48,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:48,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:33:48,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-27 12:33:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:48,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056005390] [2022-04-27 12:33:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:48,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519630953] [2022-04-27 12:33:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:48,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:48,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:33:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:48,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:33:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:48,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:48,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {852#true} is VALID [2022-04-27 12:33:48,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {852#true} is VALID [2022-04-27 12:33:48,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 12:33:48,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #84#return; {852#true} is VALID [2022-04-27 12:33:48,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret2 := main(); {852#true} is VALID [2022-04-27 12:33:48,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {852#true} is VALID [2022-04-27 12:33:48,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {852#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {852#true} is VALID [2022-04-27 12:33:48,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {852#true} ~cond := #in~cond; {852#true} is VALID [2022-04-27 12:33:48,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {852#true} assume !(0 == ~cond); {852#true} is VALID [2022-04-27 12:33:48,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 12:33:48,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {852#true} {852#true} #78#return; {852#true} is VALID [2022-04-27 12:33:48,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:33:48,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:33:48,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:33:48,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:33:48,962 INFO L272 TraceCheckUtils]: 15: Hoare triple {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {852#true} is VALID [2022-04-27 12:33:48,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {852#true} ~cond := #in~cond; {852#true} is VALID [2022-04-27 12:33:48,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {852#true} assume !(0 == ~cond); {852#true} is VALID [2022-04-27 12:33:48,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 12:33:48,967 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {852#true} {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:33:48,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {853#false} is VALID [2022-04-27 12:33:48,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {853#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {853#false} is VALID [2022-04-27 12:33:48,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {853#false} assume !false; {853#false} is VALID [2022-04-27 12:33:48,968 INFO L272 TraceCheckUtils]: 23: Hoare triple {853#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {853#false} is VALID [2022-04-27 12:33:48,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {853#false} ~cond := #in~cond; {853#false} is VALID [2022-04-27 12:33:48,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {853#false} assume 0 == ~cond; {853#false} is VALID [2022-04-27 12:33:48,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {853#false} assume !false; {853#false} is VALID [2022-04-27 12:33:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:33:48,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056005390] [2022-04-27 12:33:48,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519630953] [2022-04-27 12:33:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519630953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:48,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:48,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408856029] [2022-04-27 12:33:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 12:33:48,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:48,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:48,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:48,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:49,000 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,103 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-04-27 12:33:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:49,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-27 12:33:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:33:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-27 12:33:49,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-27 12:33:49,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:49,155 INFO L225 Difference]: With dead ends: 74 [2022-04-27 12:33:49,155 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:33:49,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:49,156 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:49,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:33:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 12:33:49,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:49,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:33:49,175 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:33:49,176 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:33:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,179 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-27 12:33:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-27 12:33:49,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:49,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:49,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 48 states. [2022-04-27 12:33:49,182 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 48 states. [2022-04-27 12:33:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:49,191 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-27 12:33:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-27 12:33:49,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:49,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:49,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:49,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:33:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-04-27 12:33:49,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 27 [2022-04-27 12:33:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:49,201 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-04-27 12:33:49,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:33:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-27 12:33:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:33:49,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:49,203 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:49,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:49,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -841192370, now seen corresponding path program 2 times [2022-04-27 12:33:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:49,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132985621] [2022-04-27 12:33:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:49,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:49,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399077591] [2022-04-27 12:33:49,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:33:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:49,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:33:49,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:33:49,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:33:49,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:33:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:49,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:49,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-27 12:33:49,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1196#true} is VALID [2022-04-27 12:33:49,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-27 12:33:49,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #84#return; {1196#true} is VALID [2022-04-27 12:33:49,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret2 := main(); {1196#true} is VALID [2022-04-27 12:33:49,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1196#true} is VALID [2022-04-27 12:33:49,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {1196#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {1196#true} is VALID [2022-04-27 12:33:49,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1196#true} ~cond := #in~cond; {1222#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:33:49,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1222#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1226#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:49,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1226#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1226#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:33:49,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1226#(not (= |assume_abort_if_not_#in~cond| 0))} {1196#true} #78#return; {1233#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 12:33:49,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1233#(<= (mod main_~A~0 4294967296) 5)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} assume !false; {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 12:33:49,969 INFO L272 TraceCheckUtils]: 23: Hoare triple {1237#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:49,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:49,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {1278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-27 12:33:49,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-27 12:33:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 12:33:49,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132985621] [2022-04-27 12:33:49,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399077591] [2022-04-27 12:33:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399077591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:49,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:49,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 12:33:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446710259] [2022-04-27 12:33:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-04-27 12:33:49,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:49,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:50,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:50,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:33:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:33:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:33:50,057 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:50,956 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-27 12:33:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:33:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-04-27 12:33:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:33:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-27 12:33:50,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-27 12:33:51,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:51,164 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:33:51,164 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 12:33:51,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:33:51,166 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:51,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:33:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 12:33:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 12:33:51,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:51,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,185 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,186 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:51,188 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 12:33:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-27 12:33:51,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:51,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:51,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-27 12:33:51,189 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-27 12:33:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:51,191 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 12:33:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-27 12:33:51,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:51,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:51,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:51,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:33:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-04-27 12:33:51,194 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 27 [2022-04-27 12:33:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:51,194 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-04-27 12:33:51,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:33:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-27 12:33:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:33:51,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:51,196 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:51,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:33:51,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:51,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2129198620, now seen corresponding path program 1 times [2022-04-27 12:33:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:51,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765775611] [2022-04-27 12:33:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:51,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:51,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265328911] [2022-04-27 12:33:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:51,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:51,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:51,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process