/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:55:59,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:55:59,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:55:59,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:55:59,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:55:59,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:55:59,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:55:59,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:55:59,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:55:59,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:55:59,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:55:59,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:55:59,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:55:59,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:55:59,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:55:59,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:55:59,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:55:59,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:55:59,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:55:59,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:55:59,620 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:55:59,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:55:59,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:55:59,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:55:59,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:55:59,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:55:59,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:55:59,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:55:59,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:55:59,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:55:59,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:55:59,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:55:59,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:55:59,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:55:59,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:55:59,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:55:59,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:55:59,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:55:59,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:55:59,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:55:59,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:55:59,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:55:59,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:55:59,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:55:59,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:55:59,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:55:59,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:55:59,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:55:59,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:55:59,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:55:59,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:55:59,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:55:59,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:55:59,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:55:59,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:55:59,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:55:59,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:55:59,655 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:55:59,656 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 15:55:59,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:55:59,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:55:59,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:55:59,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:55:59,896 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:55:59,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-27 15:55:59,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9d4902b/1ff4fd4d74364ff5aa1087c1781c1910/FLAG0980babc0 [2022-04-27 15:56:00,321 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:00,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-27 15:56:00,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9d4902b/1ff4fd4d74364ff5aa1087c1781c1910/FLAG0980babc0 [2022-04-27 15:56:00,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9d4902b/1ff4fd4d74364ff5aa1087c1781c1910 [2022-04-27 15:56:00,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:00,342 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:00,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:00,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:00,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:00,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc1a57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00, skipping insertion in model container [2022-04-27 15:56:00,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:00,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:00,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2022-04-27 15:56:00,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:00,518 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:00,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2022-04-27 15:56:00,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:00,540 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:00,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00 WrapperNode [2022-04-27 15:56:00,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:00,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:00,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:00,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:00,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:00,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:00,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:00,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:00,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:00,606 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 15:56:00,607 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 15:56:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:00,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:00,689 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:00,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:00,832 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:00,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:00,837 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:56:00,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00 BoogieIcfgContainer [2022-04-27 15:56:00,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:00,839 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:00,839 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:00,840 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:00,846 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00" (1/1) ... [2022-04-27 15:56:00,848 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:01,490 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 15:56:01,490 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (< 0 (mod v_main_~x~0_4 4294967296)) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-04-27 15:56:01,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:01 BasicIcfg [2022-04-27 15:56:01,496 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:01,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:01,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:01,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:01,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:00" (1/4) ... [2022-04-27 15:56:01,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c82279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:01, skipping insertion in model container [2022-04-27 15:56:01,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:00" (2/4) ... [2022-04-27 15:56:01,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c82279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:01, skipping insertion in model container [2022-04-27 15:56:01,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:00" (3/4) ... [2022-04-27 15:56:01,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c82279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:01, skipping insertion in model container [2022-04-27 15:56:01,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:01" (4/4) ... [2022-04-27 15:56:01,507 INFO L111 eAbstractionObserver]: Analyzing ICFG count_up_down-1.cJordan [2022-04-27 15:56:01,520 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:01,520 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:01,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:01,557 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@5251fbb7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4690e916 [2022-04-27 15:56:01,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 15:56:01,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:01,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:01,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-27 15:56:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472798294] [2022-04-27 15:56:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:01,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 15:56:01,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:01,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:01,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:01,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 15:56:01,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:01,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:01,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 15:56:01,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {21#true} is VALID [2022-04-27 15:56:01,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L17-2-->L17-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 15:56:01,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {22#false} is VALID [2022-04-27 15:56:01,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {22#false} is VALID [2022-04-27 15:56:01,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 15:56:01,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 15:56:01,732 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 15:56:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:01,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472798294] [2022-04-27 15:56:01,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472798294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:01,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:01,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452940744] [2022-04-27 15:56:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:01,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:01,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:01,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:01,796 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,851 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 15:56:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 15:56:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 15:56:01,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-04-27 15:56:01,895 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 15:56:01,902 INFO L225 Difference]: With dead ends: 18 [2022-04-27 15:56:01,902 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 15:56:01,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:56:01,909 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:01,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 15:56:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 15:56:01,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:01,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,934 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,935 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,938 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 15:56:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 15:56:01,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 15:56:01,940 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 15:56:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:01,946 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 15:56:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 15:56:01,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:01,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:01,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:01,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 15:56:01,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 15:56:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:01,950 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 15:56:01,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 15:56:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 15:56:01,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:01,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:01,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:01,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-27 15:56:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:01,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864239655] [2022-04-27 15:56:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 15:56:02,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 15:56:02,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83#true} {83#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 15:56:02,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {83#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:02,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 15:56:02,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 15:56:02,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 15:56:02,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {83#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 15:56:02,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {88#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 15:56:02,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {88#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [46] L17-2-->L17-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {89#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 15:56:02,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {89#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {90#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:02,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {91#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:02,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#(not (= __VERIFIER_assert_~cond 0))} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 15:56:02,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 15:56:02,184 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 15:56:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:02,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864239655] [2022-04-27 15:56:02,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864239655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:02,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:02,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:56:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90599187] [2022-04-27 15:56:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:02,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:02,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:02,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:56:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:56:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:02,203 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,370 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 15:56:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:56:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:56:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 15:56:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 15:56:02,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-27 15:56:02,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:02,398 INFO L225 Difference]: With dead ends: 16 [2022-04-27 15:56:02,398 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 15:56:02,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 15:56:02,401 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:02,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 15:56:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 15:56:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 15:56:02,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:02,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,406 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,406 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,408 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 15:56:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:02,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:02,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:02,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 15:56:02,409 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 15:56:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:02,410 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 15:56:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:02,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:02,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:02,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:02,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 15:56:02,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 15:56:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:02,414 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 15:56:02,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 15:56:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:02,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:02,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:02,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:02,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-27 15:56:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:02,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036738980] [2022-04-27 15:56:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:02,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,505 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-27 15:56:02,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:02,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:02,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:02,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-27 15:56:02,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:02,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:02,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:02,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {163#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:02,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [47] L17-2-->L17-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {164#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 main_~x~0)))) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 15:56:02,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~y~0 main_~x~0)))) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [46] L17-2-->L17-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {165#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 15:56:02,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {165#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:02,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {167#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:02,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(not (= __VERIFIER_assert_~cond 0))} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:02,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036738980] [2022-04-27 15:56:02,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036738980] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466939945] [2022-04-27 15:56:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:02,867 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 15:56:02,901 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 15:56:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 15:56:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:02,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:09,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:09,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-27 15:56:09,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:09,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:09,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:09,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {163#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:09,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [47] L17-2-->L17-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {190#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)))} is VALID [2022-04-27 15:56:09,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)))} [46] L17-2-->L17-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {194#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} is VALID [2022-04-27 15:56:09,734 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(or (and (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) main_~y~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:09,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:09,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:09,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:09,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:17,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {159#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:17,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {159#false} is VALID [2022-04-27 15:56:17,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:17,417 INFO L272 TraceCheckUtils]: 8: Hoare triple {165#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:17,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [46] L17-2-->L17-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {165#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 15:56:17,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(forall ((aux_mod_v_main_~x~0_9_30 Int)) (or (< 0 aux_mod_v_main_~x~0_9_30) (and (or (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_9_30 Int)) (not (= main_~x~0 (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30))))) (or (forall ((aux_div_v_main_~y~0_10_31 Int) (aux_div_v_main_~x~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1) (<= (+ v_it_1 (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30 1) main_~x~0))) (not (< (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30)) (< (+ main_~n~0 (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (not (< 0 (mod main_~x~0 4294967296)))) (or (< 0 (mod main_~x~0 4294967296)) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1)) (forall ((aux_div_v_main_~x~0_9_30 Int)) (not (= main_~x~0 (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30))))) (or (forall ((aux_div_v_main_~y~0_10_31 Int) (aux_div_v_main_~x~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1) (<= (+ v_it_1 (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30 1) main_~x~0))) (not (< (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) main_~x~0)) (<= (+ (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) 4294967296 aux_mod_v_main_~x~0_9_30) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30)))) (not (< 0 (mod main_~x~0 4294967296))))) (< aux_mod_v_main_~x~0_9_30 0)))} [47] L17-2-->L17-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {221#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 15:56:17,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {225#(forall ((aux_mod_v_main_~x~0_9_30 Int)) (or (< 0 aux_mod_v_main_~x~0_9_30) (and (or (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_9_30 Int)) (not (= main_~x~0 (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30))))) (or (forall ((aux_div_v_main_~y~0_10_31 Int) (aux_div_v_main_~x~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1) (<= (+ v_it_1 (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30 1) main_~x~0))) (not (< (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30)) (< (+ main_~n~0 (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))) (not (< 0 (mod main_~x~0 4294967296)))) (or (< 0 (mod main_~x~0 4294967296)) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1)) (forall ((aux_div_v_main_~x~0_9_30 Int)) (not (= main_~x~0 (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30))))) (or (forall ((aux_div_v_main_~y~0_10_31 Int) (aux_div_v_main_~x~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1) (<= (+ v_it_1 (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30 1) main_~x~0))) (not (< (+ (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30) main_~x~0)) (<= (+ (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) 4294967296 aux_mod_v_main_~x~0_9_30) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* aux_div_v_main_~y~0_10_31 4294967296) (* aux_div_v_main_~x~0_9_30 4294967296) aux_mod_v_main_~x~0_9_30)))) (not (< 0 (mod main_~x~0 4294967296))))) (< aux_mod_v_main_~x~0_9_30 0)))} is VALID [2022-04-27 15:56:17,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:17,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:17,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:17,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {158#true} is VALID [2022-04-27 15:56:17,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#true} is VALID [2022-04-27 15:56:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:17,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466939945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:17,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:17,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 15:56:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114577518] [2022-04-27 15:56:17,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:17,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:17,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:18,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 15:56:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 15:56:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2022-04-27 15:56:18,957 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:19,092 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 15:56:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:56:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-04-27 15:56:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-04-27 15:56:19,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2022-04-27 15:56:19,154 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 15:56:19,154 INFO L225 Difference]: With dead ends: 17 [2022-04-27 15:56:19,154 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 15:56:19,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2022-04-27 15:56:19,156 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:19,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-04-27 15:56:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 15:56:19,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 15:56:19,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:19,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,158 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,158 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:19,159 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 15:56:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:56:19,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:19,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:19,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 15:56:19,160 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 15:56:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:19,161 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 15:56:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:56:19,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:19,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:19,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:19,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 15:56:19,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 15:56:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:19,163 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 15:56:19,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 15:56:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 15:56:19,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:19,163 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:19,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 15:56:19,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:19,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 557977664, now seen corresponding path program 2 times [2022-04-27 15:56:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:19,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920561627] [2022-04-27 15:56:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:19,387 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:19,389 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_6 .cse0 (* (- 4294967296) (div (+ main_~x~0_6 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:19,439 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:19,478 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.6))) (+ main_~x~0_6 .cse0 (* (- 4294967296) (div (+ main_~x~0_6 .cse0) 4294967296)))) 0)) [2022-04-27 15:56:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:19,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {309#true} is VALID [2022-04-27 15:56:19,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 15:56:19,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 15:56:19,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:19,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {309#true} is VALID [2022-04-27 15:56:19,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 15:56:19,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 15:56:19,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 15:56:19,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0, main_~n~0] {314#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 15:56:19,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [47] L17-2-->L17-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {315#(or (and (<= (+ main_~y~0 main_~x~0) (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) (= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~n~0)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-27 15:56:20,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(or (and (<= (+ main_~y~0 main_~x~0) (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) (= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~n~0)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [47] L17-2-->L17-2: Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_3 v_main_~y~0_2)) (and (< v_main_~y~0_3 v_main_~y~0_2) (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_1 1) v_main_~y~0_2)) (not (<= 1 v_it_1)))) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_3 (* (- 1) v_main_~y~0_2)))))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {316#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 15:56:20,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [46] L17-2-->L17-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {317#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 15:56:20,152 INFO L272 TraceCheckUtils]: 9: Hoare triple {317#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~y~0_5 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:20,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {319#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:20,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#(not (= __VERIFIER_assert_~cond 0))} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-27 15:56:20,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-27 15:56:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920561627] [2022-04-27 15:56:20,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920561627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:20,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214346428] [2022-04-27 15:56:20,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 15:56:20,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:20,160 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 15:56:20,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process