/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/const_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:10:32,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:10:32,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:10:32,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:10:32,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:10:32,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:10:32,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:10:32,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:10:32,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:10:32,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:10:32,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:10:32,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:10:32,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:10:32,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:10:32,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:10:32,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:10:32,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:10:32,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:10:32,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:10:32,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:10:32,773 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:10:32,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:10:32,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:10:32,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:10:32,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:10:32,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:10:32,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:10:32,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:10:32,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:10:32,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:10:32,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:10:32,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:10:32,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:10:32,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:10:32,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:10:32,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:10:32,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:10:32,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:10:32,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:10:32,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:10:32,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:10:32,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:10:32,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:10:32,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:10:32,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:10:32,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:10:32,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:10:32,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:32,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:10:32,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:10:32,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:10:32,794 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:10:32,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:10:32,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:10:32,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:10:32,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:10:32,941 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:10:32,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-1.c [2022-04-27 16:10:32,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0f94cfd/8f4307584e8b4a8b81bc3b5d02705e87/FLAG094c8982f [2022-04-27 16:10:33,369 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:10:33,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-1.c [2022-04-27 16:10:33,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0f94cfd/8f4307584e8b4a8b81bc3b5d02705e87/FLAG094c8982f [2022-04-27 16:10:33,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0f94cfd/8f4307584e8b4a8b81bc3b5d02705e87 [2022-04-27 16:10:33,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:10:33,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:10:33,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:33,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:10:33,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:10:33,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccaf36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33, skipping insertion in model container [2022-04-27 16:10:33,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:10:33,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:10:33,550 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/const_1-1.c[321,334] [2022-04-27 16:10:33,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:33,562 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:10:33,569 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/const_1-1.c[321,334] [2022-04-27 16:10:33,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:10:33,578 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:10:33,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33 WrapperNode [2022-04-27 16:10:33,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:10:33,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:10:33,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:10:33,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:10:33,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:10:33,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:10:33,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:10:33,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:10:33,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:10:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:10:33,616 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:10:33,626 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:10:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:10:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:10:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:10:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:10:33,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:10:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:10:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:10:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:10:33,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:10:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:10:33,680 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:10:33,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:10:33,750 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:10:33,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:10:33,754 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:10:33,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:33 BoogieIcfgContainer [2022-04-27 16:10:33,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:10:33,756 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:10:33,756 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:10:33,756 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:10:33,758 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:33" (1/1) ... [2022-04-27 16:10:33,759 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:10:35,389 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:10:35,622 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:10:35,622 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_1 0) (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~y~0_2 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_1, main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_2 4294967296))) (or (and (= v_main_~x~0_1 0) (< v_main_~y~0_2 v_main_~y~0_1) (<= (div (+ (* (- 1) v_main_~y~0_1) 1024) (- 4294967296)) (+ (div (+ v_main_~y~0_2 (- 4294967295)) 4294967296) 1)) (< .cse0 1024)) (and (<= 1024 .cse0) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_5 v_main_~x~0_1)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] [2022-04-27 16:10:35,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:35 BasicIcfg [2022-04-27 16:10:35,628 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:10:35,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:10:35,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:10:35,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:10:35,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:10:33" (1/4) ... [2022-04-27 16:10:35,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe1152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:35, skipping insertion in model container [2022-04-27 16:10:35,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:10:33" (2/4) ... [2022-04-27 16:10:35,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe1152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:10:35, skipping insertion in model container [2022-04-27 16:10:35,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:10:33" (3/4) ... [2022-04-27 16:10:35,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfe1152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:10:35, skipping insertion in model container [2022-04-27 16:10:35,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:10:35" (4/4) ... [2022-04-27 16:10:35,636 INFO L111 eAbstractionObserver]: Analyzing ICFG const_1-1.cJordan [2022-04-27 16:10:35,645 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:10:35,645 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:10:35,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:10:35,679 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@14803f32, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c8ae49b [2022-04-27 16:10:35,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:10:35,684 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:10:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:10:35,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:35,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:35,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-27 16:10:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:35,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984363658] [2022-04-27 16:10:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:35,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:35,801 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 16:10:35,801 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:10:35,802 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:10:35,803 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:10:35,803 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-27 16:10:35,804 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:10:35,804 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:10:35,804 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:10:35,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21#true} is VALID [2022-04-27 16:10:35,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 16:10:35,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_4 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} 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:10:35,806 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:10:35,806 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:10:35,806 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:10:35,806 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:10:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984363658] [2022-04-27 16:10:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984363658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:10:35,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:10:35,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:10:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440789183] [2022-04-27 16:10:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:10:35,814 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:10:35,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:35,818 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:10:35,828 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:10:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:10:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:10:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:10:35,850 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:10:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:35,891 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 16:10:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:10:35,892 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:10:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:10:35,893 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:10:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 16:10:35,902 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:10:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-04-27 16:10:35,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-04-27 16:10:35,926 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:10:35,932 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:10:35,932 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 16:10:35,933 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:10:35,936 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:10:35,937 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:10:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 16:10:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 16:10:35,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:10:35,957 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:10:35,957 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:10:35,958 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:10:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:35,960 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:10:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:10:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:35,961 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:10:35,962 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:10:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:35,968 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:10:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:10:35,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:35,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:35,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:10:35,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:10:35,969 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:10:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 16:10:35,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 16:10:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:10:35,971 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 16:10:35,971 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:10:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:10:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:10:35,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:35,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:35,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:10:35,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-27 16:10:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:35,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368179796] [2022-04-27 16:10:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:35,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,084 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 16:10:36,084 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:10:36,085 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:10:36,085 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:10:36,085 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {83#true} is VALID [2022-04-27 16:10:36,086 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:10:36,086 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:10:36,086 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:10:36,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {88#(= main_~y~0 0)} is VALID [2022-04-27 16:10:36,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {88#(= main_~y~0 0)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 16:10:36,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {84#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_4 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} 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:10:36,088 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:10:36,088 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:10:36,088 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:10:36,089 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:10:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368179796] [2022-04-27 16:10:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368179796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:10:36,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:10:36,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:10:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240538972] [2022-04-27 16:10:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:10:36,090 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:10:36,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:36,091 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:10:36,100 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:10:36,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:10:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:10:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:10:36,105 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:10:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:36,150 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:10:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:10:36,151 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:10:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:10:36,151 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:10:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:10:36,154 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:10:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:10:36,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-04-27 16:10:36,169 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:10:36,170 INFO L225 Difference]: With dead ends: 13 [2022-04-27 16:10:36,170 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:10:36,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:10:36,172 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:10:36,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:10:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:10:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:10:36,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:10:36,176 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:10:36,176 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:10:36,177 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:10:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:36,178 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:10:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:10:36,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:36,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:36,180 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:10:36,180 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:10:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:36,181 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:10:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:10:36,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:36,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:36,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:10:36,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:10:36,181 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:10:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:10:36,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 16:10:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:10:36,183 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:10:36,183 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:10:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:10:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:10:36,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:10:36,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:10:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:10:36,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:10:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:10:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-27 16:10:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:10:36,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606407613] [2022-04-27 16:10:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:10:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:10:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,297 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 16:10:36,297 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:10:36,297 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:10:36,297 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:10:36,298 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 16:10:36,298 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:10:36,298 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:10:36,298 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:10:36,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {151#(= main_~y~0 0)} is VALID [2022-04-27 16:10:36,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= main_~y~0 0)} [47] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~y~0_2 4294967296))) (or (and (= v_main_~x~0_1 0) (< v_main_~y~0_2 v_main_~y~0_1) (<= (div (+ (* (- 1) v_main_~y~0_1) 1024) (- 4294967296)) (+ (div (+ v_main_~y~0_2 (- 4294967295)) 4294967296) 1)) (< .cse0 1024)) (and (<= 1024 .cse0) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_5 v_main_~x~0_1)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {152#(= main_~x~0 0)} is VALID [2022-04-27 16:10:36,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(= main_~x~0 0)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {152#(= main_~x~0 0)} is VALID [2022-04-27 16:10:36,300 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(= main_~x~0 0)} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_4 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} 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:10:36,301 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:10:36,301 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:10:36,302 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:10:36,302 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:10:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:10:36,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606407613] [2022-04-27 16:10:36,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606407613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:10:36,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906839330] [2022-04-27 16:10:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:10:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:10:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:10:36,304 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:10:36,305 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:10:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:10:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:10:36,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:10:36,596 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:10:36,598 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 16:10:36,598 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:10:36,598 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:10:36,598 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:10:36,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {151#(= main_~y~0 0)} is VALID [2022-04-27 16:10:36,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= main_~y~0 0)} [47] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~y~0_2 4294967296))) (or (and (= v_main_~x~0_1 0) (< v_main_~y~0_2 v_main_~y~0_1) (<= (div (+ (* (- 1) v_main_~y~0_1) 1024) (- 4294967296)) (+ (div (+ v_main_~y~0_2 (- 4294967295)) 4294967296) 1)) (< .cse0 1024)) (and (<= 1024 .cse0) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_5 v_main_~x~0_1)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {177#(and (<= (div (+ (* (- 1) main_~y~0) 1024) (- 4294967296)) 0) (= main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-27 16:10:36,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(and (<= (div (+ (* (- 1) main_~y~0) 1024) (- 4294967296)) 0) (= main_~x~0 0) (< 0 main_~y~0))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {152#(= main_~x~0 0)} is VALID [2022-04-27 16:10:36,603 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(= main_~x~0 0)} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_4 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:10:36,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(<= 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] {188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:10:36,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 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:10:36,604 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:10:36,605 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:10:36,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:10:37,095 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:10:37,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 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:10:37,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(<= 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] {188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:10:37,097 INFO L272 TraceCheckUtils]: 8: Hoare triple {204#(= (mod main_~x~0 4294967296) 0)} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_4 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:10:37,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(or (< (mod main_~y~0 4294967296) 1024) (= (mod main_~x~0 4294967296) 0))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {204#(= (mod main_~x~0 4294967296) 0)} is VALID [2022-04-27 16:10:37,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#(< (mod main_~y~0 4294967296) 1024)} [47] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~y~0_2 4294967296))) (or (and (= v_main_~x~0_1 0) (< v_main_~y~0_2 v_main_~y~0_1) (<= (div (+ (* (- 1) v_main_~y~0_1) 1024) (- 4294967296)) (+ (div (+ v_main_~y~0_2 (- 4294967295)) 4294967296) 1)) (< .cse0 1024)) (and (<= 1024 .cse0) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_5 v_main_~x~0_1)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {208#(or (< (mod main_~y~0 4294967296) 1024) (= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-27 16:10:37,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {212#(< (mod main_~y~0 4294967296) 1024)} is VALID [2022-04-27 16:10:37,101 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:10:37,101 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:10:37,101 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:10:37,101 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) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 16:10:37,101 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:10:37,101 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:10:37,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906839330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:10:37,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:10:37,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-27 16:10:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367590688] [2022-04-27 16:10:37,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:10:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:10:37,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:10:37,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:37,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:10:37,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 16:10:37,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:10:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 16:10:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:10:37,121 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:37,260 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-27 16:10:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:10:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:10:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:10:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-04-27 16:10:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-04-27 16:10:37,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 12 transitions. [2022-04-27 16:10:37,276 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:10:37,276 INFO L225 Difference]: With dead ends: 11 [2022-04-27 16:10:37,276 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:10:37,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-27 16:10:37,277 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:10:37,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:10:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:10:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:10:37,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:10:37,278 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:10:37,278 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:10:37,278 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:10:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:37,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:10:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:10:37,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:37,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:37,278 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:10:37,278 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:10:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:10:37,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:10:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:10:37,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:37,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:10:37,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:10:37,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:10:37,279 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:10:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:10:37,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 16:10:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:10:37,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:10:37,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:10:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:10:37,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:10:37,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:10:37,307 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:10:37,495 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:10:37,497 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:10:37,499 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:10:37,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:10:37 BasicIcfg [2022-04-27 16:10:37,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:10:37,501 INFO L158 Benchmark]: Toolchain (without parser) took 4112.35ms. Allocated memory was 231.7MB in the beginning and 331.4MB in the end (delta: 99.6MB). Free memory was 183.4MB in the beginning and 206.5MB in the end (delta: -23.0MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,501 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 199.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:10:37,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.85ms. Allocated memory is still 231.7MB. Free memory was 183.3MB in the beginning and 208.1MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,502 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 231.7MB. Free memory was 208.1MB in the beginning and 207.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,502 INFO L158 Benchmark]: RCFGBuilder took 159.32ms. Allocated memory is still 231.7MB. Free memory was 206.6MB in the beginning and 197.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,502 INFO L158 Benchmark]: IcfgTransformer took 1872.61ms. Allocated memory is still 231.7MB. Free memory was 197.1MB in the beginning and 166.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,502 INFO L158 Benchmark]: TraceAbstraction took 1870.76ms. Allocated memory was 231.7MB in the beginning and 331.4MB in the end (delta: 99.6MB). Free memory was 166.2MB in the beginning and 206.5MB in the end (delta: -40.2MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2022-04-27 16:10:37,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 231.7MB. Free memory is still 199.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.85ms. Allocated memory is still 231.7MB. Free memory was 183.3MB in the beginning and 208.1MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 231.7MB. Free memory was 208.1MB in the beginning and 207.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 159.32ms. Allocated memory is still 231.7MB. Free memory was 206.6MB in the beginning and 197.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 1872.61ms. Allocated memory is still 231.7MB. Free memory was 197.1MB in the beginning and 166.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1870.76ms. Allocated memory was 231.7MB in the beginning and 331.4MB in the end (delta: 99.6MB). Free memory was 166.2MB in the beginning and 206.5MB in the end (delta: -40.2MB). Peak memory consumption was 60.5MB. 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: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 35 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 1.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 3 NumberOfNonLiveVariables, 54 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/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:10:37,537 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...