/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:05:17,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:05:17,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:05:17,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:05:17,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:05:17,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:05:17,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:05:17,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:05:17,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:05:17,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:05:17,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:05:17,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:05:17,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:05:17,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:05:17,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:05:17,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:05:17,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:05:17,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:05:17,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:05:17,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:05:17,266 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:05:17,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:05:17,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:05:17,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:05:17,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:05:17,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:05:17,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:05:17,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:05:17,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:05:17,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:05:17,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:05:17,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:05:17,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:05:17,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:05:17,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:05:17,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:05:17,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:05:17,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:05:17,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:05:17,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:05:17,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:05:17,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:05:17,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:05:17,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:05:17,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:05:17,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:05:17,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:05:17,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:05:17,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:05:17,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:05:17,300 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:05:17,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:05:17,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:05:17,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:05:17,301 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:05:17,301 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 20:05:17,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:05:17,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:05:17,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:05:17,501 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:05:17,502 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:05:17,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-14 20:05:17,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854c8803e/060e48b469234d6c87a596023d3ba759/FLAG86b81da55 [2022-04-14 20:05:17,899 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:05:17,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-14 20:05:17,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854c8803e/060e48b469234d6c87a596023d3ba759/FLAG86b81da55 [2022-04-14 20:05:18,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854c8803e/060e48b469234d6c87a596023d3ba759 [2022-04-14 20:05:18,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:05:18,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:05:18,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:05:18,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:05:18,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:05:18,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c728bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18, skipping insertion in model container [2022-04-14 20:05:18,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:05:18,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:05:18,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-14 20:05:18,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:05:18,489 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:05:18,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-14 20:05:18,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:05:18,507 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:05:18,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18 WrapperNode [2022-04-14 20:05:18,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:05:18,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:05:18,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:05:18,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:05:18,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:05:18,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:05:18,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:05:18,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:05:18,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:05:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:05:18,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 20:05:18,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 20:05:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:05:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:05:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:05:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:05:18,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:05:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:05:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:05:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:05:18,632 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:05:18,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:05:18,770 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:05:18,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:05:18,775 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:05:18,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:18 BoogieIcfgContainer [2022-04-14 20:05:18,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:05:18,776 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:05:18,776 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:05:18,777 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:05:18,779 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:18" (1/1) ... [2022-04-14 20:05:18,780 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:05:18,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:05:18 BasicIcfg [2022-04-14 20:05:18,795 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:05:18,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:05:18,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:05:18,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:05:18,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:05:18" (1/4) ... [2022-04-14 20:05:18,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b4162f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:05:18, skipping insertion in model container [2022-04-14 20:05:18,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:05:18" (2/4) ... [2022-04-14 20:05:18,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b4162f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:05:18, skipping insertion in model container [2022-04-14 20:05:18,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:05:18" (3/4) ... [2022-04-14 20:05:18,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b4162f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:05:18, skipping insertion in model container [2022-04-14 20:05:18,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:05:18" (4/4) ... [2022-04-14 20:05:18,800 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.iJordan [2022-04-14 20:05:18,804 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:05:18,804 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:05:18,829 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:05:18,833 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 20:05:18,833 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:05:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:05:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:05:18,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:18,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:18,849 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1724549087, now seen corresponding path program 1 times [2022-04-14 20:05:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:18,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698505650] [2022-04-14 20:05:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-14 20:05:19,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:19,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-14 20:05:19,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {24#true} is VALID [2022-04-14 20:05:19,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 20:05:19,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [62] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 20:05:19,046 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {25#false} is VALID [2022-04-14 20:05:19,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-14 20:05:19,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 20:05:19,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 20:05:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:19,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698505650] [2022-04-14 20:05:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698505650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:05:19,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:05:19,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:05:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559940486] [2022-04-14 20:05:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:05:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:05:19,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:19,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:05:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:05:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:05:19,106 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,162 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 20:05:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:05:19,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:05:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-14 20:05:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-14 20:05:19,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-14 20:05:19,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,226 INFO L225 Difference]: With dead ends: 21 [2022-04-14 20:05:19,226 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 20:05:19,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:05:19,230 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:19,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 20:05:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 20:05:19,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:19,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,250 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,250 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,255 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 20:05:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 20:05:19,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:05:19,256 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:05:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,260 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 20:05:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 20:05:19,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:19,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-14 20:05:19,265 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-14 20:05:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:19,265 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-14 20:05:19,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 20:05:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:05:19,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:19,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:19,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:05:19,273 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1725472608, now seen corresponding path program 1 times [2022-04-14 20:05:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:19,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137067944] [2022-04-14 20:05:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-14 20:05:19,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 20:05:19,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 20:05:19,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:19,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-14 20:05:19,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 20:05:19,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 20:05:19,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 20:05:19,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {95#true} is VALID [2022-04-14 20:05:19,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {100#(<= main_~i~0 0)} is VALID [2022-04-14 20:05:19,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#(<= main_~i~0 0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 20:05:19,350 INFO L272 TraceCheckUtils]: 8: Hoare triple {96#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {96#false} is VALID [2022-04-14 20:05:19,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {96#false} is VALID [2022-04-14 20:05:19,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 20:05:19,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {96#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 20:05:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:19,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137067944] [2022-04-14 20:05:19,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137067944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:05:19,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:05:19,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 20:05:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471026885] [2022-04-14 20:05:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:05:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:05:19,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:19,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 20:05:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 20:05:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 20:05:19,369 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,432 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-14 20:05:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 20:05:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 20:05:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-14 20:05:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-14 20:05:19,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-14 20:05:19,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,449 INFO L225 Difference]: With dead ends: 16 [2022-04-14 20:05:19,449 INFO L226 Difference]: Without dead ends: 16 [2022-04-14 20:05:19,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:05:19,450 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:19,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-14 20:05:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-14 20:05:19,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:19,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,453 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,453 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,454 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-14 20:05:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 20:05:19,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16 states. [2022-04-14 20:05:19,455 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16 states. [2022-04-14 20:05:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,456 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-14 20:05:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 20:05:19,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:19,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-14 20:05:19,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-14 20:05:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:19,458 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-14 20:05:19,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-14 20:05:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 20:05:19,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:19,458 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:19,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:05:19,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475853, now seen corresponding path program 1 times [2022-04-14 20:05:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:19,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862119523] [2022-04-14 20:05:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {169#true} is VALID [2022-04-14 20:05:19,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-14 20:05:19,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-14 20:05:19,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:19,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {169#true} is VALID [2022-04-14 20:05:19,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-14 20:05:19,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-14 20:05:19,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-14 20:05:19,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {169#true} is VALID [2022-04-14 20:05:19,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {169#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {174#(<= 0 main_~i~0)} is VALID [2022-04-14 20:05:19,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(<= 0 main_~i~0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {175#(<= 1 main_~i~0)} is VALID [2022-04-14 20:05:19,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(<= 1 main_~i~0)} [66] L26-->L23-3: Formula: (<= v_main_~i~0_5 0) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {170#false} is VALID [2022-04-14 20:05:19,513 INFO L272 TraceCheckUtils]: 9: Hoare triple {170#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {170#false} is VALID [2022-04-14 20:05:19,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {170#false} is VALID [2022-04-14 20:05:19,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {170#false} is VALID [2022-04-14 20:05:19,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#false} is VALID [2022-04-14 20:05:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862119523] [2022-04-14 20:05:19,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862119523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:05:19,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:05:19,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:05:19,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890414365] [2022-04-14 20:05:19,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:05:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-14 20:05:19,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:19,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:05:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:05:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:05:19,529 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,589 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-14 20:05:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:05:19,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-14 20:05:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-14 20:05:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-14 20:05:19,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-14 20:05:19,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,613 INFO L225 Difference]: With dead ends: 15 [2022-04-14 20:05:19,613 INFO L226 Difference]: Without dead ends: 15 [2022-04-14 20:05:19,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-14 20:05:19,619 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:19,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-14 20:05:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-14 20:05:19,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:19,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,623 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,623 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,625 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-14 20:05:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:05:19,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-14 20:05:19,627 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-14 20:05:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:19,628 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-14 20:05:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:05:19,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:19,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:19,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:19,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-14 20:05:19,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-14 20:05:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:19,633 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-14 20:05:19,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-14 20:05:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 20:05:19,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:19,633 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:19,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 20:05:19,634 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1260871293, now seen corresponding path program 1 times [2022-04-14 20:05:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:19,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537162010] [2022-04-14 20:05:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-14 20:05:19,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:19,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-14 20:05:19,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {243#true} is VALID [2022-04-14 20:05:19,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {248#(<= main_~i~0 0)} is VALID [2022-04-14 20:05:19,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= main_~i~0 0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {249#(<= main_~i~0 1)} is VALID [2022-04-14 20:05:19,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#(<= main_~i~0 1)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {249#(<= main_~i~0 1)} is VALID [2022-04-14 20:05:19,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#(<= main_~i~0 1)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,708 INFO L272 TraceCheckUtils]: 10: Hoare triple {244#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {244#false} is VALID [2022-04-14 20:05:19,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {244#false} is VALID [2022-04-14 20:05:19,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:19,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537162010] [2022-04-14 20:05:19,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537162010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:05:19,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378122063] [2022-04-14 20:05:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:05:19,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 20:05:19,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 20:05:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 20:05:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:19,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:05:19,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-14 20:05:19,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {243#true} is VALID [2022-04-14 20:05:19,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {248#(<= main_~i~0 0)} is VALID [2022-04-14 20:05:19,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= main_~i~0 0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {249#(<= main_~i~0 1)} is VALID [2022-04-14 20:05:19,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#(<= main_~i~0 1)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {249#(<= main_~i~0 1)} is VALID [2022-04-14 20:05:19,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#(<= main_~i~0 1)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,845 INFO L272 TraceCheckUtils]: 10: Hoare triple {244#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {244#false} is VALID [2022-04-14 20:05:19,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {244#false} is VALID [2022-04-14 20:05:19,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:05:19,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#false} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {244#false} is VALID [2022-04-14 20:05:19,905 INFO L272 TraceCheckUtils]: 10: Hoare triple {244#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {244#false} is VALID [2022-04-14 20:05:19,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#(< main_~i~0 100)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-14 20:05:19,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#(< main_~i~0 100)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {305#(< main_~i~0 100)} is VALID [2022-04-14 20:05:19,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#(< main_~i~0 99)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {305#(< main_~i~0 100)} is VALID [2022-04-14 20:05:19,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {312#(< main_~i~0 99)} is VALID [2022-04-14 20:05:19,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {243#true} is VALID [2022-04-14 20:05:19,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-14 20:05:19,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-14 20:05:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:19,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378122063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:05:19,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 20:05:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-14 20:05:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113945835] [2022-04-14 20:05:19,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 20:05:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 20:05:19,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:19,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:19,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:19,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 20:05:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 20:05:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-14 20:05:19,921 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:20,032 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-14 20:05:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 20:05:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 20:05:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-14 20:05:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-14 20:05:20,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-14 20:05:20,053 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 20:05:20,054 INFO L225 Difference]: With dead ends: 21 [2022-04-14 20:05:20,054 INFO L226 Difference]: Without dead ends: 21 [2022-04-14 20:05:20,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-14 20:05:20,055 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:20,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:05:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-14 20:05:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-14 20:05:20,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:20,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,057 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,057 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:20,058 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-14 20:05:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-14 20:05:20,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:20,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:20,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 21 states. [2022-04-14 20:05:20,058 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 21 states. [2022-04-14 20:05:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:20,059 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-14 20:05:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-14 20:05:20,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:20,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:20,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:20,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-14 20:05:20,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-14 20:05:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:20,061 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-14 20:05:20,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-14 20:05:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 20:05:20,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:05:20,061 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:05:20,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 20:05:20,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:20,275 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:05:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:05:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1622480812, now seen corresponding path program 2 times [2022-04-14 20:05:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:05:20,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142374065] [2022-04-14 20:05:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:05:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:05:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:05:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:20,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {428#true} is VALID [2022-04-14 20:05:20,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:05:20,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {428#true} is VALID [2022-04-14 20:05:20,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {428#true} is VALID [2022-04-14 20:05:20,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {433#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:20,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(<= 0 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {434#(<= 0 main_~c~0)} is VALID [2022-04-14 20:05:20,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {435#(<= 1 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:20,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(<= 1 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {436#(<= 1 main_~c~0)} is VALID [2022-04-14 20:05:20,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(<= 1 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {437#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} is VALID [2022-04-14 20:05:20,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {438#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:20,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {438#(<= 4 (+ main_~i~0 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {438#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:20,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#(<= 4 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {439#(<= 4 main_~c~0)} is VALID [2022-04-14 20:05:20,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#(<= 4 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {439#(<= 4 main_~c~0)} is VALID [2022-04-14 20:05:20,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#(<= 4 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {439#(<= 4 main_~c~0)} is VALID [2022-04-14 20:05:20,426 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#(<= 4 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {440#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:05:20,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {440#(not (= |__VERIFIER_assert_#in~cond| 0))} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {441#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:05:20,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {441#(not (= __VERIFIER_assert_~cond 0))} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:20,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:05:20,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142374065] [2022-04-14 20:05:20,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142374065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:05:20,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090107348] [2022-04-14 20:05:20,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 20:05:20,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:05:20,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 20:05:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 20:05:20,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 20:05:20,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:05:20,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 20:05:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:05:20,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:05:20,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {428#true} is VALID [2022-04-14 20:05:20,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:20,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {428#true} is VALID [2022-04-14 20:05:20,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {464#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} is VALID [2022-04-14 20:05:20,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {434#(<= 0 main_~c~0)} is VALID [2022-04-14 20:05:20,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {471#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} is VALID [2022-04-14 20:05:20,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {475#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-14 20:05:20,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#(and (< 0 main_~c~0) (< 1 main_~i~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {475#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-14 20:05:20,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#(and (< 0 main_~c~0) (< 1 main_~i~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {482#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-14 20:05:20,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#(and (< 2 main_~i~0) (< 2 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {482#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-14 20:05:20,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#(and (< 2 main_~i~0) (< 2 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {489#(< 5 main_~c~0)} is VALID [2022-04-14 20:05:20,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {489#(< 5 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {489#(< 5 main_~c~0)} is VALID [2022-04-14 20:05:20,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {489#(< 5 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {489#(< 5 main_~c~0)} is VALID [2022-04-14 20:05:20,768 INFO L272 TraceCheckUtils]: 16: Hoare triple {489#(< 5 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:05:20,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {499#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:05:20,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {503#(<= 1 __VERIFIER_assert_~cond)} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:20,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:20,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:05:21,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:21,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {503#(<= 1 __VERIFIER_assert_~cond)} [70] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-14 20:05:21,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {499#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:05:21,341 INFO L272 TraceCheckUtils]: 16: Hoare triple {434#(<= 0 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:05:21,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {434#(<= 0 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {434#(<= 0 main_~c~0)} is VALID [2022-04-14 20:05:21,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {434#(<= 0 main_~c~0)} is VALID [2022-04-14 20:05:21,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(<= 0 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {434#(<= 0 main_~c~0)} is VALID [2022-04-14 20:05:21,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {433#(<= 0 (+ main_~i~0 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {433#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:21,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {534#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {433#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-14 20:05:21,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {534#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {534#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-14 20:05:21,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {541#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {534#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-14 20:05:21,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {545#(<= (div main_~c~0 (- 2)) 3)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {541#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-14 20:05:21,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {545#(<= (div main_~c~0 (- 2)) 3)} is VALID [2022-04-14 20:05:21,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {549#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} is VALID [2022-04-14 20:05:21,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {428#true} is VALID [2022-04-14 20:05:21,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:21,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:21,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:21,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {428#true} is VALID [2022-04-14 20:05:21,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-14 20:05:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:05:21,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090107348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:05:21,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 20:05:21,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2022-04-14 20:05:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930215655] [2022-04-14 20:05:21,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 20:05:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 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 20 [2022-04-14 20:05:21,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:05:21,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:21,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:21,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-14 20:05:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:05:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-14 20:05:21,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-04-14 20:05:21,378 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:21,702 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-14 20:05:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 20:05:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 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 20 [2022-04-14 20:05:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:05:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-04-14 20:05:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-04-14 20:05:21,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2022-04-14 20:05:21,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:05:21,721 INFO L225 Difference]: With dead ends: 19 [2022-04-14 20:05:21,721 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:05:21,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-14 20:05:21,722 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:05:21,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:05:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:05:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:05:21,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:05:21,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:05:21,723 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:05:21,723 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:05:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:21,723 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:05:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:21,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:21,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:21,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 20:05:21,723 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 20:05:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:05:21,723 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:05:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:21,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:05:21,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:05:21,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:05:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:05:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:05:21,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-14 20:05:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:05:21,724 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:05:21,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:05:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:05:21,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:05:21,726 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:05:21,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 20:05:21,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:05:21,940 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-14 20:05:21,941 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:05:21,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:05:21 BasicIcfg [2022-04-14 20:05:21,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:05:21,943 INFO L158 Benchmark]: Toolchain (without parser) took 3610.89ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 153.0MB in the beginning and 202.3MB in the end (delta: -49.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:05:21,943 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:05:21,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.93ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 177.7MB in the end (delta: -25.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:05:21,944 INFO L158 Benchmark]: Boogie Preprocessor took 35.46ms. Allocated memory is still 201.3MB. Free memory was 177.7MB in the beginning and 176.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:05:21,944 INFO L158 Benchmark]: RCFGBuilder took 232.29ms. Allocated memory is still 201.3MB. Free memory was 176.2MB in the beginning and 165.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:05:21,944 INFO L158 Benchmark]: IcfgTransformer took 19.03ms. Allocated memory is still 201.3MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:05:21,944 INFO L158 Benchmark]: TraceAbstraction took 3145.93ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.1MB in the beginning and 202.3MB in the end (delta: -38.2MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. [2022-04-14 20:05:21,945 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.93ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 177.7MB in the end (delta: -25.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.46ms. Allocated memory is still 201.3MB. Free memory was 177.7MB in the beginning and 176.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 232.29ms. Allocated memory is still 201.3MB. Free memory was 176.2MB in the beginning and 165.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.03ms. Allocated memory is still 201.3MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3145.93ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.1MB in the beginning and 202.3MB in the end (delta: -38.2MB). Peak memory consumption was 4.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 67 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 4 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 18/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 20:05:21,970 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...