/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-crafted-1/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:24:55,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:24:55,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:24:56,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:24:56,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:24:56,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:24:56,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:24:56,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:24:56,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:24:56,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:24:56,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:24:56,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:24:56,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:24:56,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:24:56,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:24:56,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:24:56,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:24:56,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:24:56,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:24:56,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:24:56,047 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:24:56,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:24:56,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:24:56,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:24:56,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:24:56,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:24:56,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:24:56,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:24:56,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:24:56,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:24:56,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:24:56,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:24:56,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:24:56,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:24:56,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:24:56,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:24:56,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:24:56,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:24:56,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:24:56,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:24:56,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:24:56,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:24:56,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:24:56,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:24:56,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:24:56,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:24:56,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:24:56,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:24:56,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:24:56,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:24:56,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:24:56,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:24:56,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:24:56,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:24:56,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:24:56,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:24:56,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:24:56,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:24:56,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:24:56,087 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:24:56,087 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-07 17:24:56,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:24:56,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:24:56,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:24:56,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:24:56,357 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:24:56,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-07 17:24:56,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67128d32/b873b9d9aa824b51a7ef4cb6f9701877/FLAG17af407ad [2022-04-07 17:24:56,738 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:24:56,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-07 17:24:56,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67128d32/b873b9d9aa824b51a7ef4cb6f9701877/FLAG17af407ad [2022-04-07 17:24:57,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67128d32/b873b9d9aa824b51a7ef4cb6f9701877 [2022-04-07 17:24:57,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:24:57,158 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:24:57,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:24:57,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:24:57,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:24:57,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3fe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57, skipping insertion in model container [2022-04-07 17:24:57,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:24:57,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:24:57,308 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-crafted-1/in-de32.c[368,381] [2022-04-07 17:24:57,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:24:57,352 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:24:57,364 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-crafted-1/in-de32.c[368,381] [2022-04-07 17:24:57,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:24:57,388 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:24:57,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57 WrapperNode [2022-04-07 17:24:57,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:24:57,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:24:57,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:24:57,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:24:57,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:24:57,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:24:57,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:24:57,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:24:57,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:24:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:24:57,468 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-07 17:24:57,494 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-07 17:24:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:24:57,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:24:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:24:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:24:57,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:24:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:24:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:24:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:24:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:24:57,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 17:24:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:24:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:24:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:24:57,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:24:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:24:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:24:57,577 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:24:57,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:24:57,768 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:24:57,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:24:57,774 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 17:24:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:24:57 BoogieIcfgContainer [2022-04-07 17:24:57,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:24:57,776 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:24:57,777 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:24:57,777 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:24:57,780 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:24:57" (1/1) ... [2022-04-07 17:24:57,782 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:24:58,359 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-07 17:24:58,360 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5, 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_7 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~x~0_7 v_main_~x~0_6) (= v_main_~y~0_6 v_main_~y~0_5)) (and (< 0 .cse0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (= v_main_~x~0_6 (+ v_main_~x~0_7 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-04-07 17:24:58,762 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-07 17:24:58,763 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~z~0_5 4294967296)) (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (= v_main_~z~0_5 (+ v_main_~z~0_4 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_4, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_5 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (= v_main_~x~0_8 (+ (* (- 1) v_main_~z~0_4) v_main_~x~0_9 v_main_~z~0_5)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_4 v_it_2 1) v_main_~z~0_5)) (< 0 (mod (+ v_main_~z~0_5 (* v_it_2 4294967295)) 4294967296)))) (< v_main_~z~0_4 v_main_~z~0_5)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_5, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-04-07 17:24:59,091 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-07 17:24:59,091 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_2 1)) (< 0 (mod v_main_~y~0_4 4294967296)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] [2022-04-07 17:24:59,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:24:59 BasicIcfg [2022-04-07 17:24:59,099 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:24:59,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:24:59,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:24:59,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:24:59,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:24:57" (1/4) ... [2022-04-07 17:24:59,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0b1e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:24:59, skipping insertion in model container [2022-04-07 17:24:59,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:24:57" (2/4) ... [2022-04-07 17:24:59,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0b1e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:24:59, skipping insertion in model container [2022-04-07 17:24:59,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:24:57" (3/4) ... [2022-04-07 17:24:59,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0b1e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:24:59, skipping insertion in model container [2022-04-07 17:24:59,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:24:59" (4/4) ... [2022-04-07 17:24:59,110 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.cJordan [2022-04-07 17:24:59,114 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:24:59,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:24:59,154 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:24:59,161 INFO L340 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 [2022-04-07 17:24:59,161 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:24:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-07 17:24:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:24:59,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:24:59,184 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:24:59,184 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:24:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:24:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1909530012, now seen corresponding path program 1 times [2022-04-07 17:24:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:24:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513805121] [2022-04-07 17:24:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:24:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:24:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:24:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:24:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:24:59,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {25#true} is VALID [2022-04-07 17:24:59,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 17:24:59,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 17:24:59,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:24:59,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {25#true} is VALID [2022-04-07 17:24:59,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 17:24:59,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 17:24:59,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 17:24:59,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {25#true} is VALID [2022-04-07 17:24:59,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [70] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 17:24:59,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {26#false} is VALID [2022-04-07 17:24:59,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [74] L23-2-->L29-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 17:24:59,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [77] L29-1-->L29-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 17:24:59,350 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {26#false} is VALID [2022-04-07 17:24:59,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-07 17:24:59,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 17:24:59,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 17:24:59,351 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-07 17:24:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:24:59,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513805121] [2022-04-07 17:24:59,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513805121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:24:59,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:24:59,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:24:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591509917] [2022-04-07 17:24:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:24:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-07 17:24:59,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:24:59,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:24:59,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:24:59,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:24:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:24:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:24:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:24:59,404 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:24:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,459 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-07 17:24:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:24:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-07 17:24:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:24:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:24:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 17:24:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:24:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 17:24:59,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-07 17:24:59,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:24:59,510 INFO L225 Difference]: With dead ends: 22 [2022-04-07 17:24:59,510 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 17:24:59,511 INFO L912 BasicCegarLoop]: 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-07 17:24:59,516 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 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-07 17:24:59,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:24:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 17:24:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 17:24:59,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:24:59,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-07 17:24:59,545 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-07 17:24:59,545 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-07 17:24:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,551 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-07 17:24:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-07 17:24:59,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:24:59,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:24:59,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 15 states. [2022-04-07 17:24:59,552 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 15 states. [2022-04-07 17:24:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,554 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-07 17:24:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-07 17:24:59,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:24:59,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:24:59,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:24:59,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:24:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-07 17:24:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-07 17:24:59,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 14 [2022-04-07 17:24:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:24:59,561 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-07 17:24:59,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:24:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-07 17:24:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:24:59,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:24:59,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:24:59,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:24:59,562 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:24:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:24:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -137167005, now seen corresponding path program 1 times [2022-04-07 17:24:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:24:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787158270] [2022-04-07 17:24:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:24:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:24:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:24:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:24:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:24:59,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {100#true} is VALID [2022-04-07 17:24:59,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 17:24:59,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 17:24:59,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:24:59,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {100#true} is VALID [2022-04-07 17:24:59,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 17:24:59,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 17:24:59,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 17:24:59,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {100#true} is VALID [2022-04-07 17:24:59,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#true} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-07 17:24:59,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-07 17:24:59,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-07 17:24:59,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-07 17:24:59,646 INFO L272 TraceCheckUtils]: 10: Hoare triple {105#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {106#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:24:59,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {106#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {107#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:24:59,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {107#(not (= __VERIFIER_assert_~cond 0))} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 17:24:59,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 17:24:59,648 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-07 17:24:59,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:24:59,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787158270] [2022-04-07 17:24:59,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787158270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:24:59,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:24:59,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:24:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755974672] [2022-04-07 17:24:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:24:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-07 17:24:59,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:24:59,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-07 17:24:59,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:24:59,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:24:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:24:59,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:24:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:24:59,664 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-07 17:24:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,779 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-07 17:24:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:24:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-07 17:24:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:24:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-07 17:24:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-07 17:24:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-07 17:24:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-07 17:24:59,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-07 17:24:59,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:24:59,813 INFO L225 Difference]: With dead ends: 21 [2022-04-07 17:24:59,813 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 17:24:59,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:24:59,814 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:24:59,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-04-07 17:24:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 17:24:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-07 17:24:59,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:24:59,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 17:24:59,818 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 17:24:59,818 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 17:24:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,820 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-07 17:24:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-07 17:24:59,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:24:59,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:24:59,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 18 states. [2022-04-07 17:24:59,821 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 18 states. [2022-04-07 17:24:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:24:59,823 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-07 17:24:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-07 17:24:59,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:24:59,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:24:59,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:24:59,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:24:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 17:24:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-07 17:24:59,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-07 17:24:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:24:59,825 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-07 17:24:59,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-07 17:24:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-07 17:24:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 17:24:59,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:24:59,826 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:24:59,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:24:59,827 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:24:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:24:59,827 INFO L85 PathProgramCache]: Analyzing trace with hash 69510770, now seen corresponding path program 1 times [2022-04-07 17:24:59,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:24:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687184892] [2022-04-07 17:24:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:24:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:24:59,842 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:24:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:24:59,882 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:25:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:00,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {191#true} is VALID [2022-04-07 17:25:00,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:25:00,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {191#true} is VALID [2022-04-07 17:25:00,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {196#(= main_~y~0 0)} is VALID [2022-04-07 17:25:00,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:00,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:00,057 INFO L272 TraceCheckUtils]: 11: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {199#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:25:00,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {200#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:25:00,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {200#(not (= __VERIFIER_assert_~cond 0))} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:00,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:00,059 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-07 17:25:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:25:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687184892] [2022-04-07 17:25:00,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687184892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:25:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737776629] [2022-04-07 17:25:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:25:00,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:25:00,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:25:00,061 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-07 17:25:00,084 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-07 17:25:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:00,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 17:25:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:00,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:25:00,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {191#true} is VALID [2022-04-07 17:25:00,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:00,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {196#(= main_~y~0 0)} is VALID [2022-04-07 17:25:00,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {226#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {226#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:00,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:00,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:00,490 INFO L272 TraceCheckUtils]: 11: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:25:00,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:25:00,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:00,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:00,492 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-07 17:25:00,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:25:02,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:02,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 17:25:02,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:25:02,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:25:02,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:02,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(forall ((aux_mod_v_main_~x~0_21_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_21_31) (and (or (forall ((aux_div_v_main_~x~0_21_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296))))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((aux_div_v_main_~x~0_21_31 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_21_31 v_it_3 (* aux_div_v_main_~x~0_21_31 4294967296) 1) main_~x~0) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296)) main_~x~0)))))) (<= aux_mod_v_main_~x~0_21_31 0)))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {198#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:03,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_21_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_21_31) (and (or (forall ((aux_div_v_main_~x~0_21_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296))))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((aux_div_v_main_~x~0_21_31 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_21_31 v_it_3 (* aux_div_v_main_~x~0_21_31 4294967296) 1) main_~x~0) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296)) main_~x~0)))))) (<= aux_mod_v_main_~x~0_21_31 0))))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {265#(forall ((aux_mod_v_main_~x~0_21_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_21_31) (and (or (forall ((aux_div_v_main_~x~0_21_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296))))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((aux_div_v_main_~x~0_21_31 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_21_31 v_it_3 (* aux_div_v_main_~x~0_21_31 4294967296) 1) main_~x~0) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296)) main_~x~0)))))) (<= aux_mod_v_main_~x~0_21_31 0)))} is VALID [2022-04-07 17:25:03,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#(or (<= (div (- main_~x~0) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (< 0 (mod main_~y~0 4294967296)))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {269#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_21_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_21_31) (and (or (forall ((aux_div_v_main_~x~0_21_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296))))) (< 0 (mod main_~y~0 4294967296))) (or (not (< 0 (mod main_~y~0 4294967296))) (forall ((aux_div_v_main_~x~0_21_31 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_21_31 v_it_3 (* aux_div_v_main_~x~0_21_31 4294967296) 1) main_~x~0) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_21_31 (* aux_div_v_main_~x~0_21_31 4294967296)) main_~x~0)))))) (<= aux_mod_v_main_~x~0_21_31 0))))} is VALID [2022-04-07 17:25:03,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {273#(or (<= (div (- main_~x~0) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:25:03,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {191#true} is VALID [2022-04-07 17:25:03,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:03,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:03,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:03,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {191#true} is VALID [2022-04-07 17:25:03,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 17:25:03,352 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-07 17:25:03,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737776629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:25:03,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:25:03,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-04-07 17:25:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277237983] [2022-04-07 17:25:03,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:25:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:25:03,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:25:03,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:06,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:25:06,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:25:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:25:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:25:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:25:06,012 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:08,540 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 17:25:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 17:25:08,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:25:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:25:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2022-04-07 17:25:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2022-04-07 17:25:08,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 33 transitions. [2022-04-07 17:25:10,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:25:10,687 INFO L225 Difference]: With dead ends: 26 [2022-04-07 17:25:10,687 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 17:25:10,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-07 17:25:10,688 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:25:10,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-04-07 17:25:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 17:25:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-04-07 17:25:10,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:25:10,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:25:10,691 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:25:10,692 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:25:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:10,693 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 17:25:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 17:25:10,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:25:10,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:25:10,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 23 states. [2022-04-07 17:25:10,694 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 23 states. [2022-04-07 17:25:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:10,695 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 17:25:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 17:25:10,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:25:10,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:25:10,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:25:10,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:25:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:25:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-07 17:25:10,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-07 17:25:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:25:10,697 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-07 17:25:10,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-07 17:25:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 17:25:10,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:25:10,698 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:25:10,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 17:25:10,899 WARN L460 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-07 17:25:10,899 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:25:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:25:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 842497847, now seen corresponding path program 1 times [2022-04-07 17:25:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:25:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864974232] [2022-04-07 17:25:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:25:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:25:10,912 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:10,957 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:25:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:11,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {404#true} is VALID [2022-04-07 17:25:11,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {404#true} {404#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {404#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:25:11,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {404#true} is VALID [2022-04-07 17:25:11,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {404#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {404#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {409#(= main_~y~0 0)} is VALID [2022-04-07 17:25:11,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {409#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:11,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {411#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 17:25:11,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {411#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [76] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_5 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (= v_main_~x~0_8 (+ (* (- 1) v_main_~z~0_4) v_main_~x~0_9 v_main_~z~0_5)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_4 v_it_2 1) v_main_~z~0_5)) (< 0 (mod (+ v_main_~z~0_5 (* v_it_2 4294967295)) 4294967296)))) (< v_main_~z~0_4 v_main_~z~0_5)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_5, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:11,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:11,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:11,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {413#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:25:11,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:25:11,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:11,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:11,104 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-07 17:25:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:25:11,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864974232] [2022-04-07 17:25:11,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864974232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:25:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022573005] [2022-04-07 17:25:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:25:11,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:25:11,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:25:11,108 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-07 17:25:11,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 17:25:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:11,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 17:25:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:11,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:25:11,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {404#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {404#true} is VALID [2022-04-07 17:25:11,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {404#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {404#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:11,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {409#(= main_~y~0 0)} is VALID [2022-04-07 17:25:11,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {409#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:11,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {440#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:11,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [76] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_5 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (= v_main_~x~0_8 (+ (* (- 1) v_main_~z~0_4) v_main_~x~0_9 v_main_~z~0_5)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_4 v_it_2 1) v_main_~z~0_5)) (< 0 (mod (+ v_main_~z~0_5 (* v_it_2 4294967295)) 4294967296)))) (< v_main_~z~0_4 v_main_~z~0_5)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_5, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:11,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:11,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:11,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:25:11,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {453#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:25:11,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:11,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:11,748 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-07 17:25:11,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:25:14,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:14,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {405#false} is VALID [2022-04-07 17:25:14,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {453#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:25:14,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:25:14,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {412#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:14,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:25:15,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(or (forall ((aux_mod_v_main_~x~0_23_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_23_31) (<= aux_mod_v_main_~x~0_23_31 0) (and (or (not (< 0 (mod main_~z~0 4294967296))) (forall ((aux_div_v_main_~x~0_23_31 Int)) (or (exists ((v_it_2 Int)) (and (not (< 0 (mod (+ main_~z~0 (* v_it_2 4294967295)) 4294967296))) (<= 1 v_it_2) (<= (+ v_it_2 main_~x~0 1) (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296))))) (not (< main_~x~0 (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_23_31 Int)) (not (= (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)) main_~x~0))) (< 0 (mod main_~z~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} [76] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_5 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (= v_main_~x~0_8 (+ (* (- 1) v_main_~z~0_4) v_main_~x~0_9 v_main_~z~0_5)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_4 v_it_2 1) v_main_~z~0_5)) (< 0 (mod (+ v_main_~z~0_5 (* v_it_2 4294967295)) 4294967296)))) (< v_main_~z~0_4 v_main_~z~0_5)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_5, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:25:15,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {483#(or (forall ((aux_mod_v_main_~x~0_23_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_23_31) (<= aux_mod_v_main_~x~0_23_31 0) (and (or (not (< 0 (mod main_~z~0 4294967296))) (forall ((aux_div_v_main_~x~0_23_31 Int)) (or (exists ((v_it_2 Int)) (and (not (< 0 (mod (+ main_~z~0 (* v_it_2 4294967295)) 4294967296))) (<= 1 v_it_2) (<= (+ v_it_2 main_~x~0 1) (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296))))) (not (< main_~x~0 (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_23_31 Int)) (not (= (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)) main_~x~0))) (< 0 (mod main_~z~0 4294967296)))))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:25:15,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#true} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {476#(or (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:25:15,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {404#true} is VALID [2022-04-07 17:25:15,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {404#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:15,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:15,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {404#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:15,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {404#true} is VALID [2022-04-07 17:25:15,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {404#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {404#true} is VALID [2022-04-07 17:25:15,387 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-07 17:25:15,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022573005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:25:15,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:25:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2022-04-07 17:25:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351941405] [2022-04-07 17:25:15,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:25:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:25:15,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:25:15,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:17,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:25:17,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:25:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:25:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:25:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:25:17,431 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:17,799 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-07 17:25:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 17:25:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:25:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:25:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-07 17:25:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-07 17:25:17,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-07 17:25:18,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:25:18,091 INFO L225 Difference]: With dead ends: 31 [2022-04-07 17:25:18,091 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 17:25:18,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-04-07 17:25:18,092 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:25:18,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-04-07 17:25:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 17:25:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-04-07 17:25:18,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:25:18,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:25:18,096 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:25:18,096 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:25:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:18,098 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-07 17:25:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-07 17:25:18,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:25:18,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:25:18,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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 27 states. [2022-04-07 17:25:18,099 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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 27 states. [2022-04-07 17:25:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:25:18,100 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-07 17:25:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-07 17:25:18,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:25:18,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:25:18,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:25:18,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:25:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:25:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-07 17:25:18,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2022-04-07 17:25:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:25:18,102 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-07 17:25:18,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:25:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-07 17:25:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 17:25:18,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:25:18,103 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:25:18,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 17:25:18,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 17:25:18,319 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:25:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:25:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2113412797, now seen corresponding path program 2 times [2022-04-07 17:25:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:25:18,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350088744] [2022-04-07 17:25:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:25:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:25:18,335 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:18,336 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:18,363 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:18,370 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-04-07 17:25:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:25:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:18,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {630#true} is VALID [2022-04-07 17:25:18,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {630#true} {630#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:25:18,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {630#true} is VALID [2022-04-07 17:25:18,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {635#(= main_~y~0 0)} is VALID [2022-04-07 17:25:18,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:18,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:18,457 INFO L272 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:25:18,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {639#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:25:18,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {639#(not (= __VERIFIER_assert_~cond 0))} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:25:18,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:25:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:25:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:25:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350088744] [2022-04-07 17:25:18,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350088744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:25:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767861500] [2022-04-07 17:25:18,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:25:18,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:25:18,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:25:18,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:25:18,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:25:18,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 17:25:18,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:25:18,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 17:25:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:25:18,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:25:18,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {630#true} is VALID [2022-04-07 17:25:18,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:25:18,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {635#(= main_~y~0 0)} is VALID [2022-04-07 17:25:18,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {665#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {665#(and (= main_~z~0 main_~y~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:25:18,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:18,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:25:18,803 INFO L272 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {681#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:25:18,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {681#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {685#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:25:18,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:25:18,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:25:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:25:18,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:26:17,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:26:17,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(<= 1 __VERIFIER_assert_~cond)} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {631#false} is VALID [2022-04-07 17:26:17,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {681#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {685#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:26:17,796 INFO L272 TraceCheckUtils]: 12: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {681#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:26:17,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:26:19,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#(forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (<= 4294967296 aux_mod_v_main_~x~0_26_31) (and (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0)))) (not (< 0 (mod main_~y~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296))))))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {637#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:26:21,612 WARN L290 TraceCheckUtils]: 9: Hoare triple {711#(forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (and (or (not (< 0 (mod main_~y~0 4294967296))) (and (forall ((aux_div_v_main_~x~0_26_31 Int) (aux_mod_v_main_~x~0_27_70 Int) (aux_div_v_main_~x~0_27_70 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_27_70 v_it_3 (* aux_div_v_main_~x~0_27_70 4294967296) 1) (+ (* main_~x~0 4294967296) main_~y~0)) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296)) (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295))) (<= 4294967296 aux_mod_v_main_~x~0_27_70) (<= aux_mod_v_main_~x~0_27_70 0) (<= (+ (* main_~x~0 4294967296) main_~y~0) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_27_70 (* v_it_3 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295) 1) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (<= 1 v_it_3))))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* main_~x~0 4294967295)) 4294967296)) (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))))))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296)))) (<= 4294967296 aux_mod_v_main_~x~0_26_31)))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {707#(forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (<= 4294967296 aux_mod_v_main_~x~0_26_31) (and (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0)))) (not (< 0 (mod main_~y~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296))))))} is UNKNOWN [2022-04-07 17:26:23,630 WARN L290 TraceCheckUtils]: 8: Hoare triple {715#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (and (or (not (< 0 (mod main_~y~0 4294967296))) (and (forall ((aux_div_v_main_~x~0_26_31 Int) (aux_mod_v_main_~x~0_27_70 Int) (aux_div_v_main_~x~0_27_70 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_27_70 v_it_3 (* aux_div_v_main_~x~0_27_70 4294967296) 1) (+ (* main_~x~0 4294967296) main_~y~0)) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296)) (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295))) (<= 4294967296 aux_mod_v_main_~x~0_27_70) (<= aux_mod_v_main_~x~0_27_70 0) (<= (+ (* main_~x~0 4294967296) main_~y~0) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_27_70 (* v_it_3 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295) 1) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (<= 1 v_it_3))))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* main_~x~0 4294967295)) 4294967296)) (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))))))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296)))) (<= 4294967296 aux_mod_v_main_~x~0_26_31))))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {711#(forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (and (or (not (< 0 (mod main_~y~0 4294967296))) (and (forall ((aux_div_v_main_~x~0_26_31 Int) (aux_mod_v_main_~x~0_27_70 Int) (aux_div_v_main_~x~0_27_70 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_27_70 v_it_3 (* aux_div_v_main_~x~0_27_70 4294967296) 1) (+ (* main_~x~0 4294967296) main_~y~0)) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296)) (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295))) (<= 4294967296 aux_mod_v_main_~x~0_27_70) (<= aux_mod_v_main_~x~0_27_70 0) (<= (+ (* main_~x~0 4294967296) main_~y~0) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_27_70 (* v_it_3 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295) 1) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (<= 1 v_it_3))))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* main_~x~0 4294967295)) 4294967296)) (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))))))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296)))) (<= 4294967296 aux_mod_v_main_~x~0_26_31)))} is UNKNOWN [2022-04-07 17:26:23,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#(or (<= (div (- main_~x~0) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (< 0 (mod main_~y~0 4294967296)))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {715#(or (< 0 (mod main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (<= aux_mod_v_main_~x~0_26_31 0) (and (or (not (< 0 (mod main_~y~0 4294967296))) (and (forall ((aux_div_v_main_~x~0_26_31 Int) (aux_mod_v_main_~x~0_27_70 Int) (aux_div_v_main_~x~0_27_70 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ aux_mod_v_main_~x~0_27_70 v_it_3 (* aux_div_v_main_~x~0_27_70 4294967296) 1) (+ (* main_~x~0 4294967296) main_~y~0)) (<= 1 v_it_3) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296)) (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295))) (<= 4294967296 aux_mod_v_main_~x~0_27_70) (<= aux_mod_v_main_~x~0_27_70 0) (<= (+ (* main_~x~0 4294967296) main_~y~0) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_27_70 (* v_it_3 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 main_~y~0 (* aux_div_v_main_~x~0_26_31 4294967296) (* main_~x~0 4294967295) 1) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (<= 1 v_it_3))))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_26_31 main_~y~0 (* main_~x~0 4294967295)) 4294967296)) (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~y~0 (* v_it_3 4294967295)) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))))))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) main_~x~0))) (< 0 (mod main_~y~0 4294967296)))) (<= 4294967296 aux_mod_v_main_~x~0_26_31))))} is VALID [2022-04-07 17:26:23,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#true} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {719#(or (<= (div (- main_~x~0) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 17:26:23,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {630#true} is VALID [2022-04-07 17:26:23,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {630#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:26:23,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:26:23,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:26:23,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#true} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {630#true} is VALID [2022-04-07 17:26:23,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {630#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {630#true} is VALID [2022-04-07 17:26:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:26:23,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767861500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:26:23,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:26:23,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2022-04-07 17:26:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979346045] [2022-04-07 17:26:23,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:26:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:26:23,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:26:23,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:26:28,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 27 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:26:28,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 17:26:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:26:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 17:26:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=156, Unknown=9, NotChecked=0, Total=210 [2022-04-07 17:26:28,874 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:26:40,087 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_26_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_26_31 Int) (aux_mod_v_main_~x~0_27_70 Int) (aux_div_v_main_~x~0_27_70 Int)) (let ((.cse1 (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296)))) (or (<= .cse1 (+ aux_mod_v_main_~x~0_26_31 (* 4294967295 c_main_~x~0) (* aux_div_v_main_~x~0_26_31 4294967296) c_main_~y~0)) (<= 4294967296 aux_mod_v_main_~x~0_27_70) (<= aux_mod_v_main_~x~0_27_70 0) (<= (+ (* 4294967296 c_main_~x~0) c_main_~y~0) .cse1) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ aux_mod_v_main_~x~0_27_70 v_it_3 (* aux_div_v_main_~x~0_27_70 4294967296) 1) (+ (* 4294967296 c_main_~x~0) c_main_~y~0)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_27_70 (* v_it_3 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* 4294967295 c_main_~x~0) (* aux_div_v_main_~x~0_26_31 4294967296) c_main_~y~0 1) (+ aux_mod_v_main_~x~0_27_70 (* aux_div_v_main_~x~0_27_70 4294967296))) (<= 1 v_it_3)))))) (or (forall ((aux_div_v_main_~x~0_26_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_26_31 v_it_3 (* aux_div_v_main_~x~0_26_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_3))) (not (< (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) c_main_~x~0)))) (< 0 (mod (+ aux_mod_v_main_~x~0_26_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296))))) (or .cse0 (forall ((aux_div_v_main_~x~0_26_31 Int)) (not (= (+ aux_mod_v_main_~x~0_26_31 (* aux_div_v_main_~x~0_26_31 4294967296)) c_main_~x~0)))))) (<= aux_mod_v_main_~x~0_26_31 0) (<= 4294967296 aux_mod_v_main_~x~0_26_31))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-07 17:26:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:26:42,459 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-07 17:26:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 17:26:42,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:26:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:26:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:26:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2022-04-07 17:26:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:26:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2022-04-07 17:26:42,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 37 transitions. [2022-04-07 17:26:48,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 34 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 17:26:48,618 INFO L225 Difference]: With dead ends: 32 [2022-04-07 17:26:48,618 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 17:26:48,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=110, Invalid=389, Unknown=11, NotChecked=42, Total=552 [2022-04-07 17:26:48,620 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:26:48,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 51 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-04-07 17:26:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 17:26:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-07 17:26:48,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:26:48,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:26:48,622 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:26:48,622 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:26:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:26:48,623 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 17:26:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 17:26:48,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:26:48,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:26:48,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 25 states. [2022-04-07 17:26:48,624 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 25 states. [2022-04-07 17:26:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:26:48,625 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 17:26:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 17:26:48,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:26:48,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:26:48,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:26:48,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:26:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:26:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-07 17:26:48,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-07 17:26:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:26:48,627 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-07 17:26:48,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:26:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-07 17:26:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 17:26:48,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:26:48,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:26:48,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 17:26:48,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:26:48,843 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:26:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:26:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash 374350110, now seen corresponding path program 1 times [2022-04-07 17:26:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:26:48,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980596615] [2022-04-07 17:26:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:26:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:26:48,859 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-07 17:26:48,860 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:26:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:26:48,893 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-07 17:26:48,899 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-04-07 17:26:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:26:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:26:49,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {867#true} is VALID [2022-04-07 17:26:49,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#true} is VALID [2022-04-07 17:26:49,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {867#true} {867#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#true} is VALID [2022-04-07 17:26:49,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {867#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:26:49,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {867#true} is VALID [2022-04-07 17:26:49,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#true} is VALID [2022-04-07 17:26:49,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {867#true} {867#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#true} is VALID [2022-04-07 17:26:49,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {867#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#true} is VALID [2022-04-07 17:26:49,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {867#true} [68] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {872#(= main_~y~0 0)} is VALID [2022-04-07 17:26:49,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(= main_~y~0 0)} [71] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {873#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:26:49,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [73] L16-3-->L23-2: Formula: (= v_main_~y~0_7 v_main_~z~0_2) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0] {874#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:26:49,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [76] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_5 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_5 v_main_~z~0_4) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (= v_main_~x~0_8 (+ (* (- 1) v_main_~z~0_4) v_main_~x~0_9 v_main_~z~0_5)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_4 v_it_2 1) v_main_~z~0_5)) (< 0 (mod (+ v_main_~z~0_5 (* v_it_2 4294967295)) 4294967296)))) (< v_main_~z~0_4 v_main_~z~0_5)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_5, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {874#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:26:49,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [75] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {873#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-07 17:26:49,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [79] L29-1-->L29-1: Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (= (+ v_main_~x~0_3 v_main_~y~0_3 (* (- 1) v_main_~y~0_4)) v_main_~x~0_2) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_~x~0=v_main_~x~0_3, main_#t~post9=|v_main_#t~post9_3|} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_~x~0=v_main_~x~0_2, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~x~0, main_~y~0, main_#t~post9] {875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:26:49,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [78] L29-1-->L29-2: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-07 17:26:49,030 INFO L272 TraceCheckUtils]: 12: Hoare triple {875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [80] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_10 4294967296) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {876#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:26:49,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {876#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {877#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:26:49,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#(not (= __VERIFIER_assert_~cond 0))} [84] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {868#false} is VALID [2022-04-07 17:26:49,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#false} [86] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {868#false} is VALID [2022-04-07 17:26:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:26:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:26:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980596615] [2022-04-07 17:26:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980596615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:26:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326616744] [2022-04-07 17:26:49,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:26:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:26:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:26:49,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:26:49,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process