/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/loop-new/gauss_sum.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:25:23,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:25:23,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:25:23,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:25:23,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:25:23,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:25:23,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:25:23,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:25:23,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:25:23,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:25:23,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:25:23,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:25:23,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:25:23,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:25:23,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:25:23,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:25:23,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:25:23,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:25:23,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:25:23,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:25:23,178 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:25:23,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:25:23,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:25:23,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:25:23,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:25:23,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:25:23,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:25:23,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:25:23,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:25:23,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:25:23,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:25:23,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:25:23,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:25:23,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:25:23,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:25:23,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:25:23,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:25:23,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:25:23,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:25:23,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:25:23,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:25:23,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:25:23,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:25:23,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:25:23,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:25:23,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:25:23,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:25:23,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:25:23,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:25:23,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:25:23,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:25:23,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:25:23,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:25:23,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:25:23,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:25:23,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:25:23,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:23,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:25:23,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:25:23,215 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:25:23,215 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:25:23,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:25:23,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:25:23,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:25:23,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:25:23,435 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:25:23,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-27 16:25:23,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d0dedb9/741de68410d04c998210911ad5a1cffe/FLAGd2db69b37 [2022-04-27 16:25:23,823 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:25:23,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-27 16:25:23,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d0dedb9/741de68410d04c998210911ad5a1cffe/FLAGd2db69b37 [2022-04-27 16:25:24,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d0dedb9/741de68410d04c998210911ad5a1cffe [2022-04-27 16:25:24,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:25:24,280 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:25:24,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:24,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:25:24,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:25:24,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a75acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24, skipping insertion in model container [2022-04-27 16:25:24,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:25:24,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:25:24,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c[1014,1027] [2022-04-27 16:25:24,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:24,423 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:25:24,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c[1014,1027] [2022-04-27 16:25:24,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:25:24,466 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:25:24,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24 WrapperNode [2022-04-27 16:25:24,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:25:24,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:25:24,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:25:24,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:25:24,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:25:24,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:25:24,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:25:24,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:25:24,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:25:24,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:24,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:25:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:25:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:25:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:25:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:25:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:25:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:25:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:25:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:25:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:25:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:25:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:25:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:25:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:25:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:25:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:25:24,605 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:25:24,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:25:24,705 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:25:24,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:25:24,709 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:25:24,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:24 BoogieIcfgContainer [2022-04-27 16:25:24,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:25:24,711 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:25:24,711 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:25:24,716 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:25:24,726 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:24" (1/1) ... [2022-04-27 16:25:24,728 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:25:25,319 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:25:25,319 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] to Formula: (let ((.cse1 (* (- 1) v_main_~main__i~0_3))) (or (and (= v_main_~main__i~0_3 v_main_~main__i~0_2) (= v_main_~main__sum~0_3 v_main_~main__sum~0_2) (< v_main_~main__n~0_3 v_main_~main__i~0_3)) (let ((.cse0 (div (+ .cse1 v_main_~main__i~0_2) 2))) (and (<= .cse0 (+ (div (+ (- 1) .cse1 v_main_~main__n~0_3) 2) 1)) (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2) 2) 0) (< 0 .cse0) (= (+ .cse0 v_main_~main__sum~0_2) (+ (* 2 (* .cse0 v_main_~main__i~0_3)) v_main_~main__sum~0_3 (* 2 (* .cse0 .cse0)))))) (let ((.cse2 (div (+ (- 1) .cse1 v_main_~main__i~0_2) 2))) (and (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2 1) 2) 0) (<= .cse2 (div (+ .cse1 v_main_~main__n~0_3) 2)) (<= 0 .cse2) (= v_main_~main__sum~0_2 (+ (* 2 (* .cse2 v_main_~main__i~0_3)) (* (* .cse2 .cse2) 2) v_main_~main__sum~0_3 .cse2 v_main_~main__i~0_3)))))) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] [2022-04-27 16:25:25,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:25 BasicIcfg [2022-04-27 16:25:25,323 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:25:25,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:25:25,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:25:25,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:25:25,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:25:24" (1/4) ... [2022-04-27 16:25:25,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551a598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:25, skipping insertion in model container [2022-04-27 16:25:25,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:25:24" (2/4) ... [2022-04-27 16:25:25,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551a598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:25:25, skipping insertion in model container [2022-04-27 16:25:25,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:25:24" (3/4) ... [2022-04-27 16:25:25,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551a598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:25:25, skipping insertion in model container [2022-04-27 16:25:25,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:25:25" (4/4) ... [2022-04-27 16:25:25,328 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.v+cfa-reducer.cJordan [2022-04-27 16:25:25,337 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:25:25,337 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:25:25,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:25:25,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8f8f984, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3aca7b69 [2022-04-27 16:25:25,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:25:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:25:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:25:25,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:25,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:25,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-27 16:25:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:25,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10626570] [2022-04-27 16:25:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:25,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:25:25,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179772508] [2022-04-27 16:25:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:25,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:25,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:25,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:25:25,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:25:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:25,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 16:25:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:25,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:25,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:25:25,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #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[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {19#true} is VALID [2022-04-27 16:25:25,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:25:25,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:25:25,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 16:25:25,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {19#true} is VALID [2022-04-27 16:25:25,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {42#(<= 1 main_~main__n~0)} is VALID [2022-04-27 16:25:25,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2022-04-27 16:25:25,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {20#false} is VALID [2022-04-27 16:25:25,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} [54] L47-->L49: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 16:25:25,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-27 16:25:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:25,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:25:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:25:25,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10626570] [2022-04-27 16:25:25,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:25:25,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179772508] [2022-04-27 16:25:25,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179772508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:25:25,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:25:25,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:25:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083785018] [2022-04-27 16:25:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:25:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:25:25,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:25:25,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:25,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:25:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:25:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:25:25,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:25:25,644 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:25,697 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 16:25:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:25:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:25:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:25:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-27 16:25:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-27 16:25:25,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2022-04-27 16:25:25,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:25:25,744 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:25:25,745 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:25:25,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:25:25,750 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:25:25,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:25:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:25:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:25:25,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:25:25,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,771 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,771 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:25,774 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:25:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:25:25,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:25,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:25,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:25:25,776 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:25:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:25:25,780 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:25:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:25:25,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:25:25,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:25:25,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:25:25,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:25:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:25:25,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 16:25:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:25:25,789 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:25:25,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:25:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:25:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:25:25,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:25:25,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:25:25,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:25:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 16:25:26,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:25:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:25:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-27 16:25:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:25:26,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980052916] [2022-04-27 16:25:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:25:26,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:25:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775409012] [2022-04-27 16:25:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:25:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:25:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:25:26,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:25:26,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:25:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:26,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:25:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:25:27,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:25:31,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {113#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:25:31,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #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[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {113#true} is VALID [2022-04-27 16:25:31,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:25:31,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113#true} {113#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:25:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {113#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:25:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {113#true} is VALID [2022-04-27 16:25:31,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {136#(<= 1 main_~main__n~0)} is VALID [2022-04-27 16:25:31,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#(<= 1 main_~main__n~0)} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {140#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-27 16:25:31,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} [52] L38-->L38: Formula: (let ((.cse1 (* (- 1) v_main_~main__i~0_3))) (or (and (= v_main_~main__i~0_3 v_main_~main__i~0_2) (= v_main_~main__sum~0_3 v_main_~main__sum~0_2) (< v_main_~main__n~0_3 v_main_~main__i~0_3)) (let ((.cse0 (div (+ .cse1 v_main_~main__i~0_2) 2))) (and (<= .cse0 (+ (div (+ (- 1) .cse1 v_main_~main__n~0_3) 2) 1)) (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2) 2) 0) (< 0 .cse0) (= (+ .cse0 v_main_~main__sum~0_2) (+ (* 2 (* .cse0 v_main_~main__i~0_3)) v_main_~main__sum~0_3 (* 2 (* .cse0 .cse0)))))) (let ((.cse2 (div (+ (- 1) .cse1 v_main_~main__i~0_2) 2))) (and (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2 1) 2) 0) (<= .cse2 (div (+ .cse1 v_main_~main__n~0_3) 2)) (<= 0 .cse2) (= v_main_~main__sum~0_2 (+ (* 2 (* .cse2 v_main_~main__i~0_3)) (* (* .cse2 .cse2) 2) v_main_~main__sum~0_3 .cse2 v_main_~main__i~0_3)))))) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {144#(or (and (<= (div (+ (- 1) main_~main__i~0) 2) (+ (div (+ (- 2) main_~main__n~0) 2) 1)) (= (mod (+ main_~main__i~0 1) 2) 0) (= (+ (* (* (div (+ (- 1) main_~main__i~0) 2) (div (+ (- 1) main_~main__i~0) 2)) 2) (* 2 (div (+ (- 1) main_~main__i~0) 2))) (+ main_~main__sum~0 (div (+ (- 1) main_~main__i~0) 2))) (< 0 (div (+ (- 1) main_~main__i~0) 2))) (and (<= 0 (div (+ (- 2) main_~main__i~0) 2)) (= (mod main_~main__i~0 2) 0) (<= (div (+ (- 2) main_~main__i~0) 2) (div (+ (- 1) main_~main__n~0) 2)) (= main_~main__sum~0 (+ (* (div (+ (- 2) main_~main__i~0) 2) 3) (* 2 (* (div (+ (- 2) main_~main__i~0) 2) (div (+ (- 2) main_~main__i~0) 2))) 1))))} is VALID [2022-04-27 16:25:31,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {144#(or (and (<= (div (+ (- 1) main_~main__i~0) 2) (+ (div (+ (- 2) main_~main__n~0) 2) 1)) (= (mod (+ main_~main__i~0 1) 2) 0) (= (+ (* (* (div (+ (- 1) main_~main__i~0) 2) (div (+ (- 1) main_~main__i~0) 2)) 2) (* 2 (div (+ (- 1) main_~main__i~0) 2))) (+ main_~main__sum~0 (div (+ (- 1) main_~main__i~0) 2))) (< 0 (div (+ (- 1) main_~main__i~0) 2))) (and (<= 0 (div (+ (- 2) main_~main__i~0) 2)) (= (mod main_~main__i~0 2) 0) (<= (div (+ (- 2) main_~main__i~0) 2) (div (+ (- 1) main_~main__n~0) 2)) (= main_~main__sum~0 (+ (* (div (+ (- 2) main_~main__i~0) 2) 3) (* 2 (* (div (+ (- 2) main_~main__i~0) 2) (div (+ (- 2) main_~main__i~0) 2))) 1))))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {148#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:25:31,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 16:25:31,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {114#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 16:25:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:25:31,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:28:10,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {114#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 16:28:10,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 16:28:10,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {148#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:28:12,810 WARN L290 TraceCheckUtils]: 8: Hoare triple {165#(and (or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0)) (forall ((aux_div_v_main_~main__i~0_7_47 Int)) (or (<= (* aux_div_v_main_~main__i~0_7_47 2) (+ main_~main__n~0 main_~main__i~0)) (< (+ main_~main__i~0 (div (+ (- 1) (* (- 1) main_~main__i~0) main_~main__n~0) 2) 1) aux_div_v_main_~main__i~0_7_47) (= (+ (* 2 (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2)) (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2) (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2)) 4) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2) main_~main__i~0) 4))) (<= aux_div_v_main_~main__i~0_7_47 main_~main__i~0))) (forall ((aux_div_aux_mod_v_main_~main__i~0_7_63_38 Int) (aux_div_v_main_~main__i~0_7_63 Int)) (or (<= (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38) main_~main__i~0 1) main_~main__n~0) (< aux_div_v_main_~main__i~0_7_63 0) (< (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38) 0) (< (div (+ (* (- 1) main_~main__i~0) main_~main__n~0) 2) (+ aux_div_v_main_~main__i~0_7_63 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) main_~main__i~0) 4) (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) 2) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2)) 4))) (<= 2 (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)))))} [52] L38-->L38: Formula: (let ((.cse1 (* (- 1) v_main_~main__i~0_3))) (or (and (= v_main_~main__i~0_3 v_main_~main__i~0_2) (= v_main_~main__sum~0_3 v_main_~main__sum~0_2) (< v_main_~main__n~0_3 v_main_~main__i~0_3)) (let ((.cse0 (div (+ .cse1 v_main_~main__i~0_2) 2))) (and (<= .cse0 (+ (div (+ (- 1) .cse1 v_main_~main__n~0_3) 2) 1)) (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2) 2) 0) (< 0 .cse0) (= (+ .cse0 v_main_~main__sum~0_2) (+ (* 2 (* .cse0 v_main_~main__i~0_3)) v_main_~main__sum~0_3 (* 2 (* .cse0 .cse0)))))) (let ((.cse2 (div (+ (- 1) .cse1 v_main_~main__i~0_2) 2))) (and (= (mod (+ v_main_~main__i~0_3 v_main_~main__i~0_2 1) 2) 0) (<= .cse2 (div (+ .cse1 v_main_~main__n~0_3) 2)) (<= 0 .cse2) (= v_main_~main__sum~0_2 (+ (* 2 (* .cse2 v_main_~main__i~0_3)) (* (* .cse2 .cse2) 2) v_main_~main__sum~0_3 .cse2 v_main_~main__i~0_3)))))) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {161#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is UNKNOWN [2022-04-27 16:28:14,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {169#(or (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) 0) (<= 1 main_~main__n~0))} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {165#(and (or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0)) (forall ((aux_div_v_main_~main__i~0_7_47 Int)) (or (<= (* aux_div_v_main_~main__i~0_7_47 2) (+ main_~main__n~0 main_~main__i~0)) (< (+ main_~main__i~0 (div (+ (- 1) (* (- 1) main_~main__i~0) main_~main__n~0) 2) 1) aux_div_v_main_~main__i~0_7_47) (= (+ (* 2 (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2)) (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2) (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2)) 4) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_47 2) (* (- 2) main_~main__i~0)) 2) main_~main__i~0) 4))) (<= aux_div_v_main_~main__i~0_7_47 main_~main__i~0))) (forall ((aux_div_aux_mod_v_main_~main__i~0_7_63_38 Int) (aux_div_v_main_~main__i~0_7_63 Int)) (or (<= (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38) main_~main__i~0 1) main_~main__n~0) (< aux_div_v_main_~main__i~0_7_63 0) (< (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38) 0) (< (div (+ (* (- 1) main_~main__i~0) main_~main__n~0) 2) (+ aux_div_v_main_~main__i~0_7_63 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) main_~main__i~0) 4) (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) 2) (* (* (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2) (div (+ (* aux_div_v_main_~main__i~0_7_63 2) (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)) 2)) 4))) (<= 2 (* 2 aux_div_aux_mod_v_main_~main__i~0_7_63_38)))))} is VALID [2022-04-27 16:28:14,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {169#(or (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-27 16:28:14,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {113#true} is VALID [2022-04-27 16:28:14,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {113#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:28:14,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113#true} {113#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:28:14,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:28:14,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #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[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {113#true} is VALID [2022-04-27 16:28:14,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {113#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 16:28:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:28:14,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:28:14,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980052916] [2022-04-27 16:28:14,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:28:14,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775409012] [2022-04-27 16:28:14,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775409012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:28:14,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:28:14,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 16:28:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347064542] [2022-04-27 16:28:14,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 16:28:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:28:14,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:28:14,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:28:16,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 16:28:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:28:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 16:28:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=47, Unknown=1, NotChecked=0, Total=72 [2022-04-27 16:28:16,826 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:18,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 16:28:22,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 16:28:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:27,606 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-27 16:28:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:28:27,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:28:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:28:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-27 16:28:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-27 16:28:27,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-27 16:28:29,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:28:29,768 INFO L225 Difference]: With dead ends: 11 [2022-04-27 16:28:29,768 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:28:29,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=31, Invalid=57, Unknown=2, NotChecked=0, Total=90 [2022-04-27 16:28:29,769 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:28:29,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 2 Unchecked, 4.1s Time] [2022-04-27 16:28:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:28:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:28:29,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:28:29,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:28:29,770 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:28:29,770 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:28:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:29,770 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:28:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:28:29,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:28:29,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:28:29,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:28:29,771 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:28:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:29,771 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:28:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:28:29,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:28:29,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:28:29,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:28:29,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:28:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:28:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:28:29,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 16:28:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:28:29,772 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:28:29,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:28:29,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:28:29,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:28:29,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 16:28:29,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 16:28:29,982 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 16:28:29,983 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:28:29,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:28:29 BasicIcfg [2022-04-27 16:28:29,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:28:29,986 INFO L158 Benchmark]: Toolchain (without parser) took 185706.15ms. Allocated memory was 207.6MB in the beginning and 261.1MB in the end (delta: 53.5MB). Free memory was 154.4MB in the beginning and 212.7MB in the end (delta: -58.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:28:29,986 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:28:29,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.42ms. Allocated memory is still 207.6MB. Free memory was 154.2MB in the beginning and 179.9MB in the end (delta: -25.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-27 16:28:29,987 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 207.6MB. Free memory was 179.9MB in the beginning and 178.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:28:29,987 INFO L158 Benchmark]: RCFGBuilder took 213.53ms. Allocated memory is still 207.6MB. Free memory was 178.3MB in the beginning and 167.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:28:29,987 INFO L158 Benchmark]: IcfgTransformer took 612.96ms. Allocated memory is still 207.6MB. Free memory was 167.3MB in the beginning and 143.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-27 16:28:29,988 INFO L158 Benchmark]: TraceAbstraction took 184660.77ms. Allocated memory was 207.6MB in the beginning and 261.1MB in the end (delta: 53.5MB). Free memory was 143.2MB in the beginning and 212.7MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:28:29,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.42ms. Allocated memory is still 207.6MB. Free memory was 154.2MB in the beginning and 179.9MB in the end (delta: -25.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 207.6MB. Free memory was 179.9MB in the beginning and 178.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.53ms. Allocated memory is still 207.6MB. Free memory was 178.3MB in the beginning and 167.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 612.96ms. Allocated memory is still 207.6MB. Free memory was 167.3MB in the beginning and 143.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 184660.77ms. Allocated memory was 207.6MB in the beginning and 261.1MB in the end (delta: 53.5MB). Free memory was 143.2MB in the beginning and 212.7MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 49]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 184.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 23 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 167.6s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 1 QuantifiedInterpolants, 370 SizeOfPredicates, 6 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:28:30,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...