/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-acceleration/simple_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:11:48,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:11:48,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:11:48,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:11:48,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:11:48,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:11:48,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:11:48,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:11:48,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:11:48,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:11:48,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:11:48,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:11:48,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:11:48,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:11:48,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:11:48,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:11:48,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:11:48,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:11:48,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:11:48,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:11:48,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:11:48,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:11:48,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:11:48,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:11:48,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:11:48,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:11:48,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:11:48,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:11:48,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:11:48,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:11:48,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:11:48,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:11:48,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:11:48,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:11:48,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:11:48,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:11:48,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:11:48,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:11:48,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:11:48,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:11:48,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:11:48,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:11:48,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:11:48,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:11:48,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:11:48,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:11:48,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:11:48,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:11:48,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:11:48,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:11:48,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:11:48,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:11:48,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:11:48,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:11:48,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:11:48,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:11:48,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:11:48,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:11:48,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:11:48,261 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:11:48,261 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:11:48,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:11:48,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:11:48,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:11:48,455 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:11:48,456 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:11:48,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_4-2.c [2022-04-27 16:11:48,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ec93af4/03f28ef0a5034753bb19f293d1c66774/FLAG461ff9a51 [2022-04-27 16:11:48,872 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:11:48,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-2.c [2022-04-27 16:11:48,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ec93af4/03f28ef0a5034753bb19f293d1c66774/FLAG461ff9a51 [2022-04-27 16:11:48,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ec93af4/03f28ef0a5034753bb19f293d1c66774 [2022-04-27 16:11:48,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:11:48,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:11:48,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:11:48,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:11:48,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:11:48,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:11:48" (1/1) ... [2022-04-27 16:11:48,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62943ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:48, skipping insertion in model container [2022-04-27 16:11:48,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:11:48" (1/1) ... [2022-04-27 16:11:48,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:11:48,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:11:49,044 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-acceleration/simple_4-2.c[322,335] [2022-04-27 16:11:49,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:11:49,057 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:11:49,065 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-acceleration/simple_4-2.c[322,335] [2022-04-27 16:11:49,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:11:49,076 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:11:49,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49 WrapperNode [2022-04-27 16:11:49,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:11:49,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:11:49,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:11:49,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:11:49,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:11:49,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:11:49,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:11:49,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:11:49,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:11:49,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:49,118 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:11:49,134 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:11:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:11:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:11:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:11:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:11:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:11:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:11:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:11:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:11:49,191 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:11:49,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:11:49,305 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:11:49,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:11:49,310 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:11:49,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:11:49 BoogieIcfgContainer [2022-04-27 16:11:49,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:11:49,312 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:11:49,312 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:11:49,313 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:11:49,315 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:11:49" (1/1) ... [2022-04-27 16:11:49,317 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:11:49,784 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:11:49,785 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_1 (+ (- 2) v_main_~x~0_2)) (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] to Formula: (let ((.cse0 (mod v_main_~x~0_2 4294967296))) (or (and (= (mod (+ v_main_~x~0_2 v_main_~x~0_1) 2) 0) (< 0 .cse0) (< 0 (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_2 (* v_it_1 4294967294)) 4294967296)) (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2)))) (not (<= 1 v_it_1))))) (and (= v_main_~x~0_2 v_main_~x~0_1) (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] [2022-04-27 16:11:49,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:11:49 BasicIcfg [2022-04-27 16:11:49,794 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:11:49,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:11:49,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:11:49,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:11:49,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:11:48" (1/4) ... [2022-04-27 16:11:49,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8ce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:11:49, skipping insertion in model container [2022-04-27 16:11:49,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:11:49" (2/4) ... [2022-04-27 16:11:49,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8ce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:11:49, skipping insertion in model container [2022-04-27 16:11:49,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:11:49" (3/4) ... [2022-04-27 16:11:49,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8ce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:11:49, skipping insertion in model container [2022-04-27 16:11:49,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:11:49" (4/4) ... [2022-04-27 16:11:49,804 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_4-2.cJordan [2022-04-27 16:11:49,815 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:11:49,815 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:11:49,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:11:49,858 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@34fe5ce2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ba392a9 [2022-04-27 16:11:49,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:11:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:11:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:11:49,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:49,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:49,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-27 16:11:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:49,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525503572] [2022-04-27 16:11:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 16:11:50,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 16:11:50,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 16:11:50,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:50,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 16:11:50,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 16:11:50,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 16:11:50,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 16:11:50,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435440) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {21#true} is VALID [2022-04-27 16:11:50,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L15-2-->L15-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 16:11:50,020 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {22#false} is VALID [2022-04-27 16:11:50,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {22#false} is VALID [2022-04-27 16:11:50,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 16:11:50,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 16:11:50,022 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:11:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525503572] [2022-04-27 16:11:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525503572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:50,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:50,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:11:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225773862] [2022-04-27 16:11:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:50,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:50,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,055 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:11:50,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:11:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:11:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:11:50,085 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,131 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 16:11:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:11:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 16:11:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 16:11:50,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-04-27 16:11:50,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:11:50,173 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:11:50,173 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 16:11:50,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:11:50,178 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:50,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:11:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 16:11:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 16:11:50,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:50,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,201 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,202 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,204 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:11:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:11:50,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:50,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:50,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 16:11:50,220 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 16:11:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,221 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:11:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:11:50,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:50,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:50,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:50,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 16:11:50,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 16:11:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:50,224 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 16:11:50,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:11:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:11:50,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:50,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:50,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:11:50,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-27 16:11:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:50,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936217532] [2022-04-27 16:11:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 16:11:50,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 16:11:50,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83#true} {83#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 16:11:50,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {83#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:50,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 16:11:50,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 16:11:50,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 16:11:50,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {83#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 16:11:50,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435440) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {88#(and (<= 268435440 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-27 16:11:50,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {88#(and (<= 268435440 main_~x~0) (<= (div main_~x~0 4294967296) 0))} [46] L15-2-->L15-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[] {84#false} is VALID [2022-04-27 16:11:50,313 INFO L272 TraceCheckUtils]: 7: Hoare triple {84#false} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {84#false} is VALID [2022-04-27 16:11:50,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {84#false} is VALID [2022-04-27 16:11:50,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 16:11:50,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 16:11:50,313 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:11:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936217532] [2022-04-27 16:11:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936217532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:11:50,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:11:50,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:11:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338092725] [2022-04-27 16:11:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:50,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:50,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,326 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:11:50,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:11:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:11:50,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:11:50,331 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,373 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:11:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:11:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:11:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:11:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:11:50,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-04-27 16:11:50,392 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-27 16:11:50,394 INFO L225 Difference]: With dead ends: 13 [2022-04-27 16:11:50,394 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:11:50,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:11:50,397 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:50,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:11:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:11:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:11:50,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:50,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,401 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,402 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,403 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:11:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:11:50,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:50,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:50,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:11:50,406 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:11:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:50,408 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:11:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:11:50,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:50,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:50,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:50,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:11:50,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 16:11:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:50,410 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:11:50,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:11:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:11:50,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:11:50,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:11:50,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:11:50,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:11:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:11:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-27 16:11:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:11:50,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362837563] [2022-04-27 16:11:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:11:50,438 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:11:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,494 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:11:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:11:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {146#true} is VALID [2022-04-27 16:11:50,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:50,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:50,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:11:50,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {146#true} is VALID [2022-04-27 16:11:50,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:50,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:50,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:50,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435440) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {151#(and (<= 268435440 main_~x~0) (<= main_~x~0 268435440))} is VALID [2022-04-27 16:11:50,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(and (<= 268435440 main_~x~0) (<= main_~x~0 268435440))} [47] L15-2-->L15-2: Formula: (let ((.cse0 (mod v_main_~x~0_2 4294967296))) (or (and (= (mod (+ v_main_~x~0_2 v_main_~x~0_1) 2) 0) (< 0 .cse0) (< 0 (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_2 (* v_it_1 4294967294)) 4294967296)) (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2)))) (not (<= 1 v_it_1))))) (and (= v_main_~x~0_2 v_main_~x~0_1) (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-27 16:11:50,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} [46] L15-2-->L15-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[] {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-27 16:11:50,570 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:11:50,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:11:50,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:50,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:50,571 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:11:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:11:50,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362837563] [2022-04-27 16:11:50,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362837563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:50,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401759611] [2022-04-27 16:11:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:11:50,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:50,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:11:50,574 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:11:50,575 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:11:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:11:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:11:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:11:54,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {146#true} is VALID [2022-04-27 16:11:54,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435440) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {151#(and (<= 268435440 main_~x~0) (<= main_~x~0 268435440))} is VALID [2022-04-27 16:11:54,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(and (<= 268435440 main_~x~0) (<= main_~x~0 268435440))} [47] L15-2-->L15-2: Formula: (let ((.cse0 (mod v_main_~x~0_2 4294967296))) (or (and (= (mod (+ v_main_~x~0_2 v_main_~x~0_1) 2) 0) (< 0 .cse0) (< 0 (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_2 (* v_it_1 4294967294)) 4294967296)) (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2)))) (not (<= 1 v_it_1))))) (and (= v_main_~x~0_2 v_main_~x~0_1) (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {177#(exists ((aux_div_aux_mod_v_main_~x~0_10_50_33 Int) (aux_div_v_main_~x~0_10_50 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 2) (<= 0 (* aux_div_aux_mod_v_main_~x~0_10_50_33 2)) (<= (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440)) (< 0 aux_div_v_main_~x~0_10_50) (<= (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440) (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0)) (forall ((v_it_1 Int)) (or (not (<= (+ aux_div_aux_mod_v_main_~x~0_10_50_33 v_it_1 1) aux_div_v_main_~x~0_10_50)) (< 0 (mod (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0 (* v_it_1 4294967294) (* aux_div_aux_mod_v_main_~x~0_10_50_33 4294967294)) 4294967296)) (not (<= 1 v_it_1))))))} is VALID [2022-04-27 16:11:54,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(exists ((aux_div_aux_mod_v_main_~x~0_10_50_33 Int) (aux_div_v_main_~x~0_10_50 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 2) (<= 0 (* aux_div_aux_mod_v_main_~x~0_10_50_33 2)) (<= (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440)) (< 0 aux_div_v_main_~x~0_10_50) (<= (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440) (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0)) (forall ((v_it_1 Int)) (or (not (<= (+ aux_div_aux_mod_v_main_~x~0_10_50_33 v_it_1 1) aux_div_v_main_~x~0_10_50)) (< 0 (mod (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0 (* v_it_1 4294967294) (* aux_div_aux_mod_v_main_~x~0_10_50_33 4294967294)) 4294967296)) (not (<= 1 v_it_1))))))} [46] L15-2-->L15-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[] {181#(and (not (< 0 (mod main_~x~0 4294967296))) (exists ((aux_div_aux_mod_v_main_~x~0_10_50_33 Int) (aux_div_v_main_~x~0_10_50 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 2) (<= 0 (* aux_div_aux_mod_v_main_~x~0_10_50_33 2)) (<= (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440)) (< 0 aux_div_v_main_~x~0_10_50) (<= (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440) (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0)) (forall ((v_it_1 Int)) (or (not (<= (+ aux_div_aux_mod_v_main_~x~0_10_50_33 v_it_1 1) aux_div_v_main_~x~0_10_50)) (< 0 (mod (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0 (* v_it_1 4294967294) (* aux_div_aux_mod_v_main_~x~0_10_50_33 4294967294)) 4294967296)) (not (<= 1 v_it_1)))))))} is VALID [2022-04-27 16:11:54,213 INFO L272 TraceCheckUtils]: 8: Hoare triple {181#(and (not (< 0 (mod main_~x~0 4294967296))) (exists ((aux_div_aux_mod_v_main_~x~0_10_50_33 Int) (aux_div_v_main_~x~0_10_50 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 2) (<= 0 (* aux_div_aux_mod_v_main_~x~0_10_50_33 2)) (<= (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440)) (< 0 aux_div_v_main_~x~0_10_50) (<= (+ (* aux_div_aux_mod_v_main_~x~0_10_50_33 2) 268435440) (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0)) (forall ((v_it_1 Int)) (or (not (<= (+ aux_div_aux_mod_v_main_~x~0_10_50_33 v_it_1 1) aux_div_v_main_~x~0_10_50)) (< 0 (mod (+ (* 2 aux_div_v_main_~x~0_10_50) main_~x~0 (* v_it_1 4294967294) (* aux_div_aux_mod_v_main_~x~0_10_50_33 4294967294)) 4294967296)) (not (<= 1 v_it_1)))))))} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:11:54,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:11:54,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:54,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:54,216 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:11:54,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:11:54,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:54,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 16:11:54,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:11:54,302 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} [48] L15-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_6 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:11:54,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} [46] L15-2-->L15-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[] {152#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-27 16:11:54,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} [47] L15-2-->L15-2: Formula: (let ((.cse0 (mod v_main_~x~0_2 4294967296))) (or (and (= (mod (+ v_main_~x~0_2 v_main_~x~0_1) 2) 0) (< 0 .cse0) (< 0 (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2))) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_2 (* v_it_1 4294967294)) 4294967296)) (not (<= (+ v_it_1 1) (div (+ v_main_~x~0_1 (* (- 1) v_main_~x~0_2)) (- 2)))) (not (<= 1 v_it_1))))) (and (= v_main_~x~0_2 v_main_~x~0_1) (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0] {146#true} is VALID [2022-04-27 16:11:54,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L15-2: Formula: (= v_main_~x~0_4 268435440) InVars {} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 16:11:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:11:54,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401759611] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 16:11:54,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:11:54,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 11 [2022-04-27 16:11:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907598113] [2022-04-27 16:11:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:11:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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 12 [2022-04-27 16:11:54,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:11:54,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:54,342 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:11:54,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:11:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:11:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:11:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:11:54,343 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:54,369 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-27 16:11:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:11:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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 12 [2022-04-27 16:11:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:11:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 16:11:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 16:11:54,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2022-04-27 16:11:54,381 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:11:54,382 INFO L225 Difference]: With dead ends: 11 [2022-04-27 16:11:54,382 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:11:54,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:11:54,383 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:11:54,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:11:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:11:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:11:54,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:11:54,384 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:11:54,384 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:11:54,384 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:11:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:54,384 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:54,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:54,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:54,384 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:11:54,384 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:11:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:11:54,384 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:11:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:54,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:54,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:11:54,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:11:54,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:11:54,385 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:11:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:11:54,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 16:11:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:11:54,385 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:11:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:11:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:11:54,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:11:54,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:11:54,408 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:11:54,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:11:54,597 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:11:54,599 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:11:54,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:11:54 BasicIcfg [2022-04-27 16:11:54,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:11:54,601 INFO L158 Benchmark]: Toolchain (without parser) took 5706.70ms. Allocated memory was 201.3MB in the beginning and 247.5MB in the end (delta: 46.1MB). Free memory was 151.8MB in the beginning and 169.7MB in the end (delta: -17.9MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,602 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 167.7MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:11:54,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.62ms. Allocated memory is still 201.3MB. Free memory was 151.6MB in the beginning and 178.1MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,602 INFO L158 Benchmark]: Boogie Preprocessor took 18.19ms. Allocated memory is still 201.3MB. Free memory was 178.1MB in the beginning and 176.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,602 INFO L158 Benchmark]: RCFGBuilder took 216.01ms. Allocated memory is still 201.3MB. Free memory was 176.8MB in the beginning and 167.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,602 INFO L158 Benchmark]: IcfgTransformer took 481.58ms. Allocated memory is still 201.3MB. Free memory was 167.4MB in the beginning and 148.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,603 INFO L158 Benchmark]: TraceAbstraction took 4804.59ms. Allocated memory was 201.3MB in the beginning and 247.5MB in the end (delta: 46.1MB). Free memory was 148.1MB in the beginning and 169.7MB in the end (delta: -21.6MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2022-04-27 16:11:54,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 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.13ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 167.7MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.62ms. Allocated memory is still 201.3MB. Free memory was 151.6MB in the beginning and 178.1MB in the end (delta: -26.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.19ms. Allocated memory is still 201.3MB. Free memory was 178.1MB in the beginning and 176.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.01ms. Allocated memory is still 201.3MB. Free memory was 176.8MB in the beginning and 167.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 481.58ms. Allocated memory is still 201.3MB. Free memory was 167.4MB in the beginning and 148.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4804.59ms. Allocated memory was 201.3MB in the beginning and 247.5MB in the end (delta: 46.1MB). Free memory was 148.1MB in the beginning and 169.7MB in the end (delta: -21.6MB). Peak memory consumption was 24.9MB. 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: 7]: 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 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 36 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 53 ConstructedInterpolants, 2 QuantifiedInterpolants, 258 SizeOfPredicates, 1 NumberOfNonLiveVariables, 52 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 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:11:54,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...