/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-lit/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:17:03,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:17:03,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:17:03,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:17:03,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:17:03,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:17:03,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:17:03,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:17:03,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:17:03,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:17:03,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:17:03,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:17:03,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:17:03,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:17:03,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:17:03,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:17:03,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:17:03,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:17:03,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:17:03,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:17:03,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:17:03,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:17:03,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:17:03,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:17:03,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:17:03,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:17:03,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:17:04,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:17:04,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:17:04,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:17:04,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:17:04,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:17:04,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:17:04,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:17:04,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:17:04,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:17:04,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:17:04,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:17:04,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:17:04,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:17:04,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:17:04,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:17:04,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:17:04,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:17:04,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:17:04,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:17:04,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:17:04,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:17:04,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:17:04,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:17:04,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:17:04,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:17:04,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:17:04,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:17:04,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:17:04,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:17:04,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:17:04,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:17:04,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:17:04,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:17:04,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:17:04,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:17:04,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:17:04,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:17:04,038 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:17:04,038 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 19:17:04,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:17:04,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:17:04,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:17:04,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:17:04,333 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:17:04,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-14 19:17:04,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367c5ced1/8932a20fb6a64a24ad4e7b0c817cac6c/FLAGa687d7cfc [2022-04-14 19:17:04,790 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:17:04,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-14 19:17:04,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367c5ced1/8932a20fb6a64a24ad4e7b0c817cac6c/FLAGa687d7cfc [2022-04-14 19:17:05,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367c5ced1/8932a20fb6a64a24ad4e7b0c817cac6c [2022-04-14 19:17:05,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:17:05,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:17:05,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:17:05,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:17:05,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:17:05,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e710a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05, skipping insertion in model container [2022-04-14 19:17:05,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:17:05,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:17:05,376 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-lit/cggmp2005_variant.i[895,908] [2022-04-14 19:17:05,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:17:05,392 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:17:05,403 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-lit/cggmp2005_variant.i[895,908] [2022-04-14 19:17:05,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:17:05,417 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:17:05,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05 WrapperNode [2022-04-14 19:17:05,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:17:05,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:17:05,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:17:05,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:17:05,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:17:05,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:17:05,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:17:05,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:17:05,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:17:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:17:05,471 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 19:17:05,475 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 19:17:05,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:17:05,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:17:05,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:17:05,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:17:05,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:17:05,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:17:05,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:17:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:17:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 19:17:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 19:17:05,504 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:17:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:17:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:17:05,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:17:05,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:17:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:17:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:17:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:17:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:17:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:17:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:17:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:17:05,563 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:17:05,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:17:05,695 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:17:05,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:17:05,701 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:17:05,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:17:05 BoogieIcfgContainer [2022-04-14 19:17:05,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:17:05,703 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:17:05,704 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:17:05,724 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:17:05,726 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:17:05" (1/1) ... [2022-04-14 19:17:05,728 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:17:06,217 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-14 19:17:06,218 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] to Formula: (or (and (< v_main_~mid~0_4 v_main_~mid~0_5) (< 0 (+ v_main_~mid~0_4 1)) (= (+ v_main_~lo~0_3 v_main_~mid~0_5) (+ v_main_~lo~0_2 v_main_~mid~0_4)) (= (+ v_main_~hi~0_4 v_main_~mid~0_4) (+ v_main_~hi~0_3 v_main_~mid~0_5))) (and (= v_main_~hi~0_4 v_main_~hi~0_3) (<= v_main_~mid~0_5 0) (= v_main_~mid~0_5 v_main_~mid~0_4) (= v_main_~lo~0_3 v_main_~lo~0_2))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] [2022-04-14 19:17:06,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:17:06 BasicIcfg [2022-04-14 19:17:06,224 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:17:06,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:17:06,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:17:06,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:17:06,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:17:05" (1/4) ... [2022-04-14 19:17:06,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df31230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:17:06, skipping insertion in model container [2022-04-14 19:17:06,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:17:05" (2/4) ... [2022-04-14 19:17:06,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df31230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:17:06, skipping insertion in model container [2022-04-14 19:17:06,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:17:05" (3/4) ... [2022-04-14 19:17:06,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df31230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:17:06, skipping insertion in model container [2022-04-14 19:17:06,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:17:06" (4/4) ... [2022-04-14 19:17:06,230 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.iJordan [2022-04-14 19:17:06,234 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:17:06,234 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:17:06,268 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:17:06,274 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 19:17:06,274 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:17:06,291 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 19:17:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:17:06,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:17:06,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:17:06,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:17:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:17:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1291699483, now seen corresponding path program 1 times [2022-04-14 19:17:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:17:06,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354550742] [2022-04-14 19:17:06,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:17:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:17:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:17:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:06,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:06,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 19:17:06,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [77] 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 19:17:06,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [57] 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 19:17:06,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:06,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 19:17:06,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [77] 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 19:17:06,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 19:17:06,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {23#true} is VALID [2022-04-14 19:17:06,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {23#true} is VALID [2022-04-14 19:17:06,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [66] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 19:17:06,476 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {24#false} is VALID [2022-04-14 19:17:06,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-14 19:17:06,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 19:17:06,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 19:17:06,477 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 19:17:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:17:06,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354550742] [2022-04-14 19:17:06,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354550742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:17:06,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:17:06,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:17:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574300118] [2022-04-14 19:17:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:17:06,485 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 19:17:06,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:17:06,489 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 19:17:06,507 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 19:17:06,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:17:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:17:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:17:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:17:06,556 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 19:17:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,612 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 19:17:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:17:06,613 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 19:17:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:17:06,614 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 19:17:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 19:17:06,625 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 19:17:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 19:17:06,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 19:17:06,660 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 19:17:06,666 INFO L225 Difference]: With dead ends: 20 [2022-04-14 19:17:06,667 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 19:17:06,668 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 19:17:06,673 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 19:17:06,674 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 19:17:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 19:17:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 19:17:06,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:17:06,698 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 19:17:06,699 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 19:17:06,699 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 19:17:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,703 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 19:17:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 19:17:06,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:06,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:06,705 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 19:17:06,705 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 19:17:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,711 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 19:17:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 19:17:06,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:06,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:06,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:17:06,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:17:06,712 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 19:17:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-14 19:17:06,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-14 19:17:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:17:06,717 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-14 19:17:06,719 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 19:17:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 19:17:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:17:06,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:17:06,725 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:17:06,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:17:06,726 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:17:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:17:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1292623004, now seen corresponding path program 1 times [2022-04-14 19:17:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:17:06,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215921046] [2022-04-14 19:17:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:17:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:17:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:17:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:06,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:06,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 19:17:06,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [77] 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 19:17:06,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [57] 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 19:17:06,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:06,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 19:17:06,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [77] 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 19:17:06,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 19:17:06,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {90#true} is VALID [2022-04-14 19:17:06,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {95#(not (<= main_~mid~0 0))} is VALID [2022-04-14 19:17:06,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(not (<= main_~mid~0 0))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 19:17:06,824 INFO L272 TraceCheckUtils]: 8: Hoare triple {91#false} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {91#false} is VALID [2022-04-14 19:17:06,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {91#false} is VALID [2022-04-14 19:17:06,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 19:17:06,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 19:17:06,825 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 19:17:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:17:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215921046] [2022-04-14 19:17:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215921046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:17:06,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:17:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 19:17:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419115942] [2022-04-14 19:17:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:17:06,827 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 19:17:06,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:17:06,828 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 19:17:06,840 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 19:17:06,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 19:17:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:17:06,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 19:17:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 19:17:06,843 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 19:17:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,904 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 19:17:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 19:17:06,904 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 19:17:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:17:06,905 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 19:17:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 19:17:06,908 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 19:17:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 19:17:06,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-14 19:17:06,928 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 19:17:06,929 INFO L225 Difference]: With dead ends: 14 [2022-04-14 19:17:06,929 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 19:17:06,932 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 19:17:06,934 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 19:17:06,934 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 19:17:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 19:17:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 19:17:06,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:17:06,939 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 19:17:06,939 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 19:17:06,939 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 19:17:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,941 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 19:17:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 19:17:06,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:06,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:06,942 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 19:17:06,942 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 19:17:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:06,949 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 19:17:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 19:17:06,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:06,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:06,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:17:06,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:17:06,950 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 19:17:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-14 19:17:06,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-14 19:17:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:17:06,952 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-14 19:17:06,953 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 19:17:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 19:17:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 19:17:06,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:17:06,953 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:17:06,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:17:06,954 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:17:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:17:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1443329038, now seen corresponding path program 1 times [2022-04-14 19:17:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:17:06,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738146949] [2022-04-14 19:17:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:17:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:17:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:17:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:07,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:07,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:07,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157#true} {157#true} [77] 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 19:17:07,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:17:07,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:07,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:07,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [77] 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 19:17:07,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:07,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {162#(= main_~lo~0 0)} is VALID [2022-04-14 19:17:07,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {163#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (not (<= main_~mid~0 0)) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-14 19:17:07,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (not (<= main_~mid~0 0)) (<= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (or (and (< v_main_~mid~0_4 v_main_~mid~0_5) (< 0 (+ v_main_~mid~0_4 1)) (= (+ v_main_~lo~0_3 v_main_~mid~0_5) (+ v_main_~lo~0_2 v_main_~mid~0_4)) (= (+ v_main_~hi~0_4 v_main_~mid~0_4) (+ v_main_~hi~0_3 v_main_~mid~0_5))) (and (= v_main_~hi~0_4 v_main_~hi~0_3) (<= v_main_~mid~0_5 0) (= v_main_~mid~0_5 v_main_~mid~0_4) (= v_main_~lo~0_3 v_main_~lo~0_2))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {164#(and (< main_~lo~0 (+ main_~hi~0 1)) (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= main_~hi~0 main_~lo~0)))} is VALID [2022-04-14 19:17:07,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(and (< main_~lo~0 (+ main_~hi~0 1)) (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= main_~hi~0 main_~lo~0)))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {165#(and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))} is VALID [2022-04-14 19:17:07,160 INFO L272 TraceCheckUtils]: 9: Hoare triple {165#(and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:17:07,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= |__VERIFIER_assert_#in~cond| 0))} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {167#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:17:07,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(not (= __VERIFIER_assert_~cond 0))} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:07,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:07,162 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 19:17:07,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:17:07,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738146949] [2022-04-14 19:17:07,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738146949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:17:07,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908390954] [2022-04-14 19:17:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:17:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:17:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:17:07,165 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 19:17:07,166 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 19:17:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:07,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 19:17:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:17:07,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:17:08,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:08,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [77] 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 19:17:08,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {162#(= main_~lo~0 0)} is VALID [2022-04-14 19:17:08,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {163#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (not (<= main_~mid~0 0)) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-14 19:17:08,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (not (<= main_~mid~0 0)) (<= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (or (and (< v_main_~mid~0_4 v_main_~mid~0_5) (< 0 (+ v_main_~mid~0_4 1)) (= (+ v_main_~lo~0_3 v_main_~mid~0_5) (+ v_main_~lo~0_2 v_main_~mid~0_4)) (= (+ v_main_~hi~0_4 v_main_~mid~0_4) (+ v_main_~hi~0_3 v_main_~mid~0_5))) (and (= v_main_~hi~0_4 v_main_~hi~0_3) (<= v_main_~mid~0_5 0) (= v_main_~mid~0_5 v_main_~mid~0_4) (= v_main_~lo~0_3 v_main_~lo~0_2))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {193#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< 0 (+ main_~mid~0 1)) (< 0 main_~lo~0) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} is VALID [2022-04-14 19:17:08,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< 0 (+ main_~mid~0 1)) (< 0 main_~lo~0) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {197#(and (< 0 main_~lo~0) (<= (div (+ (* (- 1) main_~hi~0) main_~lo~0) (- 2)) 0) (< 0 (+ (div (+ (* (- 1) main_~lo~0) main_~hi~0) 2) 1)))} is VALID [2022-04-14 19:17:08,470 INFO L272 TraceCheckUtils]: 9: Hoare triple {197#(and (< 0 main_~lo~0) (<= (div (+ (* (- 1) main_~hi~0) main_~lo~0) (- 2)) 0) (< 0 (+ (div (+ (* (- 1) main_~lo~0) main_~hi~0) 2) 1)))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:17:08,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:17:08,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:08,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:08,473 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 19:17:08,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:17:08,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:08,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 19:17:08,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:17:08,953 INFO L272 TraceCheckUtils]: 9: Hoare triple {165#(and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:17:08,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(or (< 0 main_~mid~0) (and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0)))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {165#(and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))} is VALID [2022-04-14 19:17:08,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(and (<= (+ (div (+ (* (- 1) main_~lo~0) (* (- 1) main_~hi~0)) (- 2)) main_~mid~0) main_~hi~0) (or (<= main_~hi~0 (+ main_~mid~0 (div (+ main_~hi~0 main_~lo~0) 2))) (<= main_~mid~0 0)) (or (not (<= main_~mid~0 0)) (and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))))} [68] L30-2-->L30-2: Formula: (or (and (< v_main_~mid~0_4 v_main_~mid~0_5) (< 0 (+ v_main_~mid~0_4 1)) (= (+ v_main_~lo~0_3 v_main_~mid~0_5) (+ v_main_~lo~0_2 v_main_~mid~0_4)) (= (+ v_main_~hi~0_4 v_main_~mid~0_4) (+ v_main_~hi~0_3 v_main_~mid~0_5))) (and (= v_main_~hi~0_4 v_main_~hi~0_3) (<= v_main_~mid~0_5 0) (= v_main_~mid~0_5 v_main_~mid~0_4) (= v_main_~lo~0_3 v_main_~lo~0_2))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {224#(or (< 0 main_~mid~0) (and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0)))} is VALID [2022-04-14 19:17:08,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {228#(and (<= (+ (div (+ (* (- 1) main_~lo~0) (* (- 1) main_~hi~0)) (- 2)) main_~mid~0) main_~hi~0) (or (<= main_~hi~0 (+ main_~mid~0 (div (+ main_~hi~0 main_~lo~0) 2))) (<= main_~mid~0 0)) (or (not (<= main_~mid~0 0)) (and (< main_~lo~0 (+ main_~hi~0 1)) (<= main_~hi~0 main_~lo~0))))} is VALID [2022-04-14 19:17:08,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {162#(= main_~lo~0 0)} is VALID [2022-04-14 19:17:08,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [77] 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 19:17:08,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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 19:17:08,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 19:17:08,958 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 19:17:08,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908390954] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:17:08,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:17:08,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-14 19:17:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812385210] [2022-04-14 19:17:08,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:17:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:08,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:17:08,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:08,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:17:08,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 19:17:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:17:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 19:17:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 19:17:08,988 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:09,237 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-14 19:17:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 19:17:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:17:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2022-04-14 19:17:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2022-04-14 19:17:09,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 13 transitions. [2022-04-14 19:17:09,254 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 19:17:09,254 INFO L225 Difference]: With dead ends: 12 [2022-04-14 19:17:09,254 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:17:09,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-04-14 19:17:09,256 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:17:09,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:17:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:17:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:17:09,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:17:09,257 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 19:17:09,257 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 19:17:09,257 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 19:17:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:09,258 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:17:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:17:09,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:09,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:09,258 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 19:17:09,258 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 19:17:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:17:09,258 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:17:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:17:09,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:09,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:17:09,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:17:09,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:17:09,259 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 19:17:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:17:09,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-14 19:17:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:17:09,259 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:17:09,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 19:17:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:17:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:17:09,262 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:17:09,289 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 19:17:09,480 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 19:17:09,483 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 19:17:09,484 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:17:09,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:17:09 BasicIcfg [2022-04-14 19:17:09,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:17:09,487 INFO L158 Benchmark]: Toolchain (without parser) took 4283.35ms. Allocated memory was 178.3MB in the beginning and 223.3MB in the end (delta: 45.1MB). Free memory was 126.6MB in the beginning and 112.0MB in the end (delta: 14.6MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,487 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:17:09,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.26ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 153.2MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,488 INFO L158 Benchmark]: Boogie Preprocessor took 25.69ms. Allocated memory is still 178.3MB. Free memory was 153.2MB in the beginning and 151.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,488 INFO L158 Benchmark]: RCFGBuilder took 257.52ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,488 INFO L158 Benchmark]: IcfgTransformer took 520.11ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 120.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,489 INFO L158 Benchmark]: TraceAbstraction took 3261.36ms. Allocated memory was 178.3MB in the beginning and 223.3MB in the end (delta: 45.1MB). Free memory was 119.7MB in the beginning and 112.0MB in the end (delta: 7.7MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. [2022-04-14 19:17:09,490 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 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.13ms. Allocated memory is still 178.3MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.26ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 153.2MB in the end (delta: -26.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.69ms. Allocated memory is still 178.3MB. Free memory was 153.2MB in the beginning and 151.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.52ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 520.11ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 120.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3261.36ms. Allocated memory was 178.3MB in the beginning and 223.3MB in the end (delta: 45.1MB). Free memory was 119.7MB in the beginning and 112.0MB in the end (delta: 7.7MB). Peak memory consumption was 53.7MB. 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: 19]: 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: 3.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 40 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 3 NumberOfNonLiveVariables, 56 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 19:17:09,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...