/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-zilu/benchmark18_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:05:47,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:05:47,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:05:47,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:05:47,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:05:47,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:05:47,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:05:47,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:05:47,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:05:47,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:05:47,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:05:47,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:05:47,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:05:47,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:05:47,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:05:47,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:05:47,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:05:47,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:05:47,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:05:47,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:05:47,438 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:05:47,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:05:47,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:05:47,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:05:47,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:05:47,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:05:47,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:05:47,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:05:47,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:05:47,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:05:47,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:05:47,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:05:47,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:05:47,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:05:47,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:05:47,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:05:47,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:05:47,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:05:47,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:05:47,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:05:47,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:05:47,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:05:47,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:05:47,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:05:47,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:05:47,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:05:47,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:05:47,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:05:47,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:05:47,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:05:47,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:05:47,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:05:47,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:05:47,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:05:47,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:05:47,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:05:47,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:05:47,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:05:47,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:05:47,465 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:05:47,465 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-14 20:05:47,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:05:47,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:05:47,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:05:47,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:05:47,672 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:05:47,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-14 20:05:47,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c33c2813/f0171605117b4c0398a51354c894b1e1/FLAG0dc236f73 [2022-04-14 20:05:48,098 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:05:48,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-14 20:05:48,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c33c2813/f0171605117b4c0398a51354c894b1e1/FLAG0dc236f73 [2022-04-14 20:05:48,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c33c2813/f0171605117b4c0398a51354c894b1e1 [2022-04-14 20:05:48,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:05:48,119 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:05:48,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:05:48,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:05:48,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:05:48,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd91a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48, skipping insertion in model container [2022-04-14 20:05:48,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:05:48,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:05:48,277 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-zilu/benchmark18_conjunctive.i[873,886] [2022-04-14 20:05:48,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:05:48,300 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:05:48,309 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-zilu/benchmark18_conjunctive.i[873,886] [2022-04-14 20:05:48,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:05:48,324 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:05:48,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48 WrapperNode [2022-04-14 20:05:48,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:05:48,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:05:48,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:05:48,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:05:48,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:05:48,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:05:48,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:05:48,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:05:48,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:05:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:05:48,386 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-14 20:05:48,405 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-14 20:05:48,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:05:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:05:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:05:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:05:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:05:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:05:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:05:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:05:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:05:48,479 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:05:48,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:05:48,627 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:05:48,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:05:48,632 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:05:48,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:48 BoogieIcfgContainer [2022-04-14 20:05:48,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:05:48,633 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:05:48,633 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:05:48,634 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:05:48,636 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:48" (1/1) ... [2022-04-14 20:05:48,637 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:05:51,278 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-14 20:05:51,406 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-14 20:05:51,406 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~k~0=v_main_~k~0_2, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] to Formula: (or (and (= (+ v_main_~i~0_3 v_main_~k~0_1) (+ v_main_~i~0_2 v_main_~k~0_2)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (<= v_main_~n~0_2 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] [2022-04-14 20:05:51,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:05:51 BasicIcfg [2022-04-14 20:05:51,410 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:05:51,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:05:51,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:05:51,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:05:51,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:05:48" (1/4) ... [2022-04-14 20:05:51,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22334586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:05:51, skipping insertion in model container [2022-04-14 20:05:51,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:48" (2/4) ... [2022-04-14 20:05:51,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22334586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:05:51, skipping insertion in model container [2022-04-14 20:05:51,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:48" (3/4) ... [2022-04-14 20:05:51,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22334586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:05:51, skipping insertion in model container [2022-04-14 20:05:51,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:05:51" (4/4) ... [2022-04-14 20:05:51,415 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark18_conjunctive.iJordan [2022-04-14 20:05:51,419 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:05:51,419 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:05:51,456 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:05:51,462 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 20:05:51,462 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:05:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 20:05:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:05:51,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:51,478 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:51,478 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-14 20:05:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:51,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630680454] [2022-04-14 20:05:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:51,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-14 20:05:51,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:51,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-14 20:05:51,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-14 20:05:51,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:05:51,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:05:51,606 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {24#false} is VALID [2022-04-14 20:05:51,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: 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] {24#false} is VALID [2022-04-14 20:05:51,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: 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[] {24#false} is VALID [2022-04-14 20:05:51,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:05:51,607 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-14 20:05:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:51,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630680454] [2022-04-14 20:05:51,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630680454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:05:51,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:05:51,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:05:51,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239284413] [2022-04-14 20:05:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:05:51,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:05:51,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:51,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:05:51,631 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-14 20:05:51,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:05:51,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:05:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:05:51,651 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:05:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,702 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:05:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:05:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:05:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:05:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:05:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:05:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:05:51,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 20:05:51,739 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-14 20:05:51,745 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:05:51,745 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 20:05:51,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:05:51,759 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-14 20:05:51,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 20:05:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 20:05:51,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:51,776 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-14 20:05:51,776 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-14 20:05:51,777 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-14 20:05:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,778 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:05:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:05:51,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:51,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:51,779 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-14 20:05:51,779 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-14 20:05:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,780 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:05:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:05:51,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:51,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:51,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:51,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:51,781 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-14 20:05:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-14 20:05:51,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-14 20:05:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:51,783 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-14 20:05:51,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:05:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:05:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:05:51,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:51,784 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:51,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:05:51,784 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-14 20:05:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844675461] [2022-04-14 20:05:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:51,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:05:51,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:05:51,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:05:51,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:51,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:05:51,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:05:51,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:05:51,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:05:51,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {90#true} is VALID [2022-04-14 20:05:51,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {95#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-14 20:05:51,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(<= (+ main_~i~0 1) main_~n~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:05:51,834 INFO L272 TraceCheckUtils]: 8: Hoare triple {91#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {91#false} is VALID [2022-04-14 20:05:51,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {91#false} is VALID [2022-04-14 20:05:51,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [63] L15-->L16: 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[] {91#false} is VALID [2022-04-14 20:05:51,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:05:51,835 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-14 20:05:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844675461] [2022-04-14 20:05:51,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844675461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:05:51,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:05:51,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 20:05:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164404667] [2022-04-14 20:05:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:05:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-14 20:05:51,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:51,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 20:05:51,849 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-14 20:05:51,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 20:05:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 20:05:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 20:05:51,850 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 20:05:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,892 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:05:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 20:05:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-14 20:05:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 20:05:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 20:05:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 20:05:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 20:05:51,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-14 20:05:51,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:51,908 INFO L225 Difference]: With dead ends: 14 [2022-04-14 20:05:51,908 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 20:05:51,908 INFO L912 BasicCegarLoop]: 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-14 20:05:51,909 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:51,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 20:05:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 20:05:51,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:51,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:51,911 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:51,911 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,916 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:05:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:05:51,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:51,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:51,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:05:51,917 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:05:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:51,924 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:05:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:05:51,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:51,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:51,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:51,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-14 20:05:51,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-14 20:05:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:51,927 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-14 20:05:51,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 20:05:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:05:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 20:05:51,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:51,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:51,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:05:51,928 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-14 20:05:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:51,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224085754] [2022-04-14 20:05:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:52,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {157#true} is VALID [2022-04-14 20:05:52,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:52,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {157#true} is VALID [2022-04-14 20:05:52,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {157#true} is VALID [2022-04-14 20:05:52,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {162#(and (<= (+ main_~i~0 1) main_~n~0) (<= main_~k~0 main_~i~0) (<= main_~i~0 main_~k~0))} is VALID [2022-04-14 20:05:52,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(and (<= (+ main_~i~0 1) main_~n~0) (<= main_~k~0 main_~i~0) (<= main_~i~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (or (and (= (+ v_main_~i~0_3 v_main_~k~0_1) (+ v_main_~i~0_2 v_main_~k~0_2)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (<= v_main_~n~0_2 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {163#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-14 20:05:52,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {164#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-14 20:05:52,080 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:05:52,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: 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] {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:05:52,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: 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[] {158#false} is VALID [2022-04-14 20:05:52,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:05:52,083 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-14 20:05:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224085754] [2022-04-14 20:05:52,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224085754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:05:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782145972] [2022-04-14 20:05:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:52,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:52,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:05:52,092 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-14 20:05:52,093 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-14 20:05:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:52,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 20:05:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:52,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:05:52,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {157#true} is VALID [2022-04-14 20:05:52,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {157#true} is VALID [2022-04-14 20:05:52,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {189#(and (< 0 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-14 20:05:52,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (< 0 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [59] L24-2-->L24-2: Formula: (or (and (= (+ v_main_~i~0_3 v_main_~k~0_1) (+ v_main_~i~0_2 v_main_~k~0_2)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (<= v_main_~n~0_2 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {193#(and (< 0 main_~i~0) (= main_~i~0 main_~k~0) (< main_~i~0 (+ main_~n~0 1)))} is VALID [2022-04-14 20:05:52,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(and (< 0 main_~i~0) (= main_~i~0 main_~k~0) (< main_~i~0 (+ main_~n~0 1)))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {197#(and (< 0 main_~i~0) (= main_~i~0 main_~k~0) (not (< main_~i~0 main_~n~0)) (< main_~i~0 (+ main_~n~0 1)))} is VALID [2022-04-14 20:05:52,592 INFO L272 TraceCheckUtils]: 9: Hoare triple {197#(and (< 0 main_~i~0) (= main_~i~0 main_~k~0) (not (< main_~i~0 main_~n~0)) (< main_~i~0 (+ main_~n~0 1)))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:05:52,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: 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] {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:05:52,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: 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[] {158#false} is VALID [2022-04-14 20:05:52,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:05:52,594 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-14 20:05:52,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:05:52,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:05:52,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: 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[] {158#false} is VALID [2022-04-14 20:05:52,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: 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] {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:05:52,883 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:05:52,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(or (< main_~i~0 main_~n~0) (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0)))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {164#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-14 20:05:52,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [59] L24-2-->L24-2: Formula: (or (and (= (+ v_main_~i~0_3 v_main_~k~0_1) (+ v_main_~i~0_2 v_main_~k~0_2)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (<= v_main_~n~0_2 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post4=|v_main_#t~post4_3|, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {224#(or (< main_~i~0 main_~n~0) (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0)))} is VALID [2022-04-14 20:05:52,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {163#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-14 20:05:52,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {157#true} is VALID [2022-04-14 20:05:52,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {157#true} is VALID [2022-04-14 20:05:52,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:05:52,886 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-14 20:05:52,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782145972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:05:52,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 20:05:52,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-14 20:05:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873901009] [2022-04-14 20:05:52,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 20:05:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 13 [2022-04-14 20:05:52,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:52,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-14 20:05:52,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:52,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 20:05:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 20:05:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-14 20:05:52,911 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-14 20:05:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:53,068 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-14 20:05:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:05:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 13 [2022-04-14 20:05:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-14 20:05:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-14 20:05:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-14 20:05:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-14 20:05:53,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2022-04-14 20:05:53,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:53,081 INFO L225 Difference]: With dead ends: 12 [2022-04-14 20:05:53,081 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:05:53,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-14 20:05:53,082 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:53,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:05:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:05:53,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:53,083 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-14 20:05:53,083 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-14 20:05:53,084 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-14 20:05:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:53,084 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:05:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:53,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:53,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:53,084 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-14 20:05:53,084 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-14 20:05:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:53,084 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:05:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:53,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:53,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:53,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:53,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:53,085 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-14 20:05:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:05:53,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-14 20:05:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:53,085 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:05:53,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-14 20:05:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:53,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:53,087 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:05:53,105 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-14 20:05:53,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:53,301 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 20:05:53,302 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:05:53,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:05:53 BasicIcfg [2022-04-14 20:05:53,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:05:53,304 INFO L158 Benchmark]: Toolchain (without parser) took 5185.55ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 151.1MB in the beginning and 107.6MB in the end (delta: 43.5MB). Peak memory consumption was 91.7MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,304 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory was 167.9MB in the beginning and 167.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:05:53,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.38ms. Allocated memory is still 202.4MB. Free memory was 150.9MB in the beginning and 177.9MB in the end (delta: -27.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,305 INFO L158 Benchmark]: Boogie Preprocessor took 35.06ms. Allocated memory is still 202.4MB. Free memory was 177.9MB in the beginning and 176.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,305 INFO L158 Benchmark]: RCFGBuilder took 271.78ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 165.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,305 INFO L158 Benchmark]: IcfgTransformer took 2776.81ms. Allocated memory is still 202.4MB. Free memory was 165.6MB in the beginning and 147.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,306 INFO L158 Benchmark]: TraceAbstraction took 1892.40ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 146.7MB in the beginning and 107.6MB in the end (delta: 39.2MB). Peak memory consumption was 87.6MB. Max. memory is 8.0GB. [2022-04-14 20:05:53,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {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.09ms. Allocated memory is still 202.4MB. Free memory was 167.9MB in the beginning and 167.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.38ms. Allocated memory is still 202.4MB. Free memory was 150.9MB in the beginning and 177.9MB in the end (delta: -27.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.06ms. Allocated memory is still 202.4MB. Free memory was 177.9MB in the beginning and 176.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 271.78ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 165.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 2776.81ms. Allocated memory is still 202.4MB. Free memory was 165.6MB in the beginning and 147.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1892.40ms. Allocated memory was 202.4MB in the beginning and 249.6MB in the end (delta: 47.2MB). Free memory was 146.7MB in the beginning and 107.6MB in the end (delta: 39.2MB). Peak memory consumption was 87.6MB. 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: 16]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 40 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 15, 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.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 4 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 10 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-14 20:05:53,334 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...