/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:20:16,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:20:16,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:20:16,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:20:16,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:20:16,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:20:16,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:20:16,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:20:16,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:20:16,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:20:16,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:20:16,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:20:16,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:20:16,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:20:16,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:20:16,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:20:16,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:20:16,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:20:16,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:20:16,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:20:16,122 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:20:16,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:20:16,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:20:16,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:20:16,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:20:16,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:20:16,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:20:16,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:20:16,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:20:16,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:20:16,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:20:16,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:20:16,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:20:16,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:20:16,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:20:16,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:20:16,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:20:16,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:20:16,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:20:16,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:20:16,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:20:16,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:20:16,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:20:16,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:20:16,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:20:16,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:20:16,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:20:16,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:20:16,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:20:16,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:20:16,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:20:16,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:20:16,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:20:16,150 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 08:20:16,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:20:16,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:20:16,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:20:16,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:20:16,371 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:20:16,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-08 08:20:16,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cecf60107/1833e9fae95b419e9ee62ff80fbab09c/FLAG742177d68 [2022-04-08 08:20:16,772 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:20:16,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-08 08:20:16,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cecf60107/1833e9fae95b419e9ee62ff80fbab09c/FLAG742177d68 [2022-04-08 08:20:16,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cecf60107/1833e9fae95b419e9ee62ff80fbab09c [2022-04-08 08:20:16,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:20:16,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:20:16,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:20:16,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:20:16,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:20:16,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:20:16" (1/1) ... [2022-04-08 08:20:16,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ad3f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:16, skipping insertion in model container [2022-04-08 08:20:16,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:20:16" (1/1) ... [2022-04-08 08:20:16,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:20:16,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:20:16,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-04-08 08:20:16,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:20:16,979 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:20:16,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-04-08 08:20:16,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:20:17,005 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:20:17,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17 WrapperNode [2022-04-08 08:20:17,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:20:17,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:20:17,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:20:17,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:20:17,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:20:17,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:20:17,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:20:17,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:20:17,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (1/1) ... [2022-04-08 08:20:17,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:20:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:20:17,061 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-08 08:20:17,062 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-08 08:20:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:20:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:20:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:20:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:20:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:20:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:20:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:20:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:20:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:20:17,137 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:20:17,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:20:17,315 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:20:17,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:20:17,320 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:20:17,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:20:17 BoogieIcfgContainer [2022-04-08 08:20:17,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:20:17,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:20:17,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:20:17,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:20:17,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:20:16" (1/3) ... [2022-04-08 08:20:17,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cfc5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:20:17, skipping insertion in model container [2022-04-08 08:20:17,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:20:17" (2/3) ... [2022-04-08 08:20:17,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cfc5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:20:17, skipping insertion in model container [2022-04-08 08:20:17,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:20:17" (3/3) ... [2022-04-08 08:20:17,326 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-08 08:20:17,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:20:17,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:20:17,356 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:20:17,361 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 08:20:17,361 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:20:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:20:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:20:17,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:17,378 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:17,378 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-08 08:20:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:17,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110624128] [2022-04-08 08:20:17,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 2 times [2022-04-08 08:20:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731778954] [2022-04-08 08:20:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:17,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-08 08:20:17,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-08 08:20:17,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-08 08:20:17,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:17,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-04-08 08:20:17,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-08 08:20:17,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-08 08:20:17,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2022-04-08 08:20:17,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {45#true} is VALID [2022-04-08 08:20:17,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {45#true} is VALID [2022-04-08 08:20:17,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {45#true} is VALID [2022-04-08 08:20:17,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 != ~p1~0;~lk1~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p1~0; {50#(= main_~lk1~0 1)} is VALID [2022-04-08 08:20:17,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {46#false} is VALID [2022-04-08 08:20:17,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-04-08 08:20:17,636 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-08 08:20:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731778954] [2022-04-08 08:20:17,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731778954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:17,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:17,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110624128] [2022-04-08 08:20:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110624128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:17,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:17,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246863835] [2022-04-08 08:20:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:20:17,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:17,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:17,667 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-08 08:20:17,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:17,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:17,685 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:17,950 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-08 08:20:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:20:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:20:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:20:17,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 08:20:18,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,092 INFO L225 Difference]: With dead ends: 82 [2022-04-08 08:20:18,092 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 08:20:18,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:18,100 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:18,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:20:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 08:20:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-08 08:20:18,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:18,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,133 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,134 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,137 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-08 08:20:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-08 08:20:18,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:18,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:18,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 08:20:18,142 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 08:20:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,150 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-08 08:20:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-08 08:20:18,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:18,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:18,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:18,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-08 08:20:18,161 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-08 08:20:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:18,161 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-08 08:20:18,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 82 transitions. [2022-04-08 08:20:18,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-08 08:20:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:20:18,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:18,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:18,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:20:18,230 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-08 08:20:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99996486] [2022-04-08 08:20:18,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 2 times [2022-04-08 08:20:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:18,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32158262] [2022-04-08 08:20:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-08 08:20:18,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-08 08:20:18,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-08 08:20:18,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:18,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-08 08:20:18,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-08 08:20:18,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-08 08:20:18,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret14 := main(); {449#true} is VALID [2022-04-08 08:20:18,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {449#true} is VALID [2022-04-08 08:20:18,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {449#true} is VALID [2022-04-08 08:20:18,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {449#true} is VALID [2022-04-08 08:20:18,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} assume !(0 != ~p1~0); {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~p1~0 0)} assume !(0 != ~p2~0); {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {454#(= main_~p1~0 0)} is VALID [2022-04-08 08:20:18,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p1~0; {450#false} is VALID [2022-04-08 08:20:18,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume 1 != ~lk1~0; {450#false} is VALID [2022-04-08 08:20:18,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-08 08:20:18,311 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-08 08:20:18,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:18,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32158262] [2022-04-08 08:20:18,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32158262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:18,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99996486] [2022-04-08 08:20:18,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99996486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663179935] [2022-04-08 08:20:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:20:18,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:18,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,327 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-08 08:20:18,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:18,328 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,518 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-08 08:20:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:20:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 08:20:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-08 08:20:18,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-08 08:20:18,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,639 INFO L225 Difference]: With dead ends: 108 [2022-04-08 08:20:18,639 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 08:20:18,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:18,645 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:18,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 08:20:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-08 08:20:18,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:18,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,664 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,665 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,668 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-08 08:20:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-08 08:20:18,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:18,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:18,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 08:20:18,670 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-08 08:20:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:18,672 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-08 08:20:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-08 08:20:18,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:18,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:18,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:18,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-08 08:20:18,674 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-08 08:20:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:18,675 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-08 08:20:18,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 114 transitions. [2022-04-08 08:20:18,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-08 08:20:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:20:18,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:18,756 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:18,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:20:18,756 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-08 08:20:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603247376] [2022-04-08 08:20:18,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 2 times [2022-04-08 08:20:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631303816] [2022-04-08 08:20:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:18,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-08 08:20:18,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 08:20:18,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-08 08:20:18,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:18,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-04-08 08:20:18,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 08:20:18,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-08 08:20:18,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret14 := main(); {941#true} is VALID [2022-04-08 08:20:18,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {941#true} is VALID [2022-04-08 08:20:18,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {941#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {941#true} is VALID [2022-04-08 08:20:18,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {941#true} is VALID [2022-04-08 08:20:18,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#true} assume 0 != ~p1~0;~lk1~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {946#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:20:18,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {942#false} is VALID [2022-04-08 08:20:18,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume 0 != ~p2~0; {942#false} is VALID [2022-04-08 08:20:18,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#false} assume 1 != ~lk2~0; {942#false} is VALID [2022-04-08 08:20:18,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-08 08:20:18,851 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-08 08:20:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631303816] [2022-04-08 08:20:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631303816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:18,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603247376] [2022-04-08 08:20:18,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603247376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034140529] [2022-04-08 08:20:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:18,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:18,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:18,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:18,868 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,012 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-08 08:20:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 08:20:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-08 08:20:19,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-08 08:20:19,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,149 INFO L225 Difference]: With dead ends: 100 [2022-04-08 08:20:19,149 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 08:20:19,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:19,150 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:19,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 08:20:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-08 08:20:19,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:19,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,156 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,157 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,158 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-08 08:20:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-08 08:20:19,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:19,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:19,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 08:20:19,159 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-08 08:20:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,161 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-08 08:20:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-08 08:20:19,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:19,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:19,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:19,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-08 08:20:19,164 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-08 08:20:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:19,165 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-08 08:20:19,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 116 transitions. [2022-04-08 08:20:19,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-08 08:20:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:20:19,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:19,265 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:19,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:20:19,265 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-08 08:20:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:19,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300876861] [2022-04-08 08:20:19,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 2 times [2022-04-08 08:20:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:19,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441494986] [2022-04-08 08:20:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:19,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:19,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1429#true} is VALID [2022-04-08 08:20:19,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-08 08:20:19,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-08 08:20:19,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:19,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1429#true} is VALID [2022-04-08 08:20:19,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-08 08:20:19,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-08 08:20:19,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret14 := main(); {1429#true} is VALID [2022-04-08 08:20:19,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1429#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {1429#true} is VALID [2022-04-08 08:20:19,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {1429#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {1429#true} is VALID [2022-04-08 08:20:19,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {1429#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {1429#true} is VALID [2022-04-08 08:20:19,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {1429#true} assume !(0 != ~p1~0); {1429#true} is VALID [2022-04-08 08:20:19,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#true} assume !(0 != ~p2~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-08 08:20:19,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p2~0; {1430#false} is VALID [2022-04-08 08:20:19,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#false} assume 1 != ~lk2~0; {1430#false} is VALID [2022-04-08 08:20:19,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2022-04-08 08:20:19,350 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-08 08:20:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441494986] [2022-04-08 08:20:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441494986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:19,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:19,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:19,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300876861] [2022-04-08 08:20:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300876861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:19,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:19,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251183009] [2022-04-08 08:20:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:19,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:19,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:19,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:19,366 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,545 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-08 08:20:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 08:20:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 08:20:19,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-08 08:20:19,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,659 INFO L225 Difference]: With dead ends: 184 [2022-04-08 08:20:19,659 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 08:20:19,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:19,660 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:19,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 08:20:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-08 08:20:19,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:19,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,671 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,671 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,675 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-08 08:20:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-08 08:20:19,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:19,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:19,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-08 08:20:19,677 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-08 08:20:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,681 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-08 08:20:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-08 08:20:19,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:19,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:19,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:19,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-08 08:20:19,686 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-08 08:20:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:19,686 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-08 08:20:19,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 213 transitions. [2022-04-08 08:20:19,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-08 08:20:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:20:19,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:19,856 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:19,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:20:19,856 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:19,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-08 08:20:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:19,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310981297] [2022-04-08 08:20:19,857 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 2 times [2022-04-08 08:20:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:19,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692040390] [2022-04-08 08:20:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:19,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2305#true} is VALID [2022-04-08 08:20:19,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-08 08:20:19,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-08 08:20:19,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:19,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2305#true} is VALID [2022-04-08 08:20:19,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-08 08:20:19,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret14 := main(); {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {2305#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {2305#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {2305#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#true} assume !(0 != ~p1~0); {2305#true} is VALID [2022-04-08 08:20:19,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#true} assume 0 != ~p2~0;~lk2~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2310#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2310#(= main_~lk2~0 1)} is VALID [2022-04-08 08:20:19,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2310#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2306#false} is VALID [2022-04-08 08:20:19,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2022-04-08 08:20:19,902 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-08 08:20:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692040390] [2022-04-08 08:20:19,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692040390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:19,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:19,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:19,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310981297] [2022-04-08 08:20:19,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310981297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:19,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:19,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750392177] [2022-04-08 08:20:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:19,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:19,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:19,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:19,916 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,043 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-08 08:20:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:20:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-08 08:20:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-08 08:20:20,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-08 08:20:20,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,124 INFO L225 Difference]: With dead ends: 159 [2022-04-08 08:20:20,124 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 08:20:20,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:20,125 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:20,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 08:20:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-08 08:20:20,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:20,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,143 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,144 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,147 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-08 08:20:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-08 08:20:20,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:20,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:20,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 08:20:20,148 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-08 08:20:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,152 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-08 08:20:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-08 08:20:20,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:20,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:20,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:20,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-08 08:20:20,156 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-08 08:20:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:20,156 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-08 08:20:20,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 211 transitions. [2022-04-08 08:20:20,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-08 08:20:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:20:20,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:20,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:20,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:20:20,312 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-08 08:20:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755353102] [2022-04-08 08:20:20,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 2 times [2022-04-08 08:20:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014209725] [2022-04-08 08:20:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:20,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3195#true} is VALID [2022-04-08 08:20:20,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-08 08:20:20,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-08 08:20:20,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {3195#true} call ULTIMATE.init(); {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {3201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret14 := main(); {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3195#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3195#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {3195#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(0 != ~p1~0); {3195#true} is VALID [2022-04-08 08:20:20,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#true} assume !(0 != ~p2~0); {3195#true} is VALID [2022-04-08 08:20:20,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#true} assume 0 != ~p3~0;~lk3~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3200#(= main_~lk3~0 1)} is VALID [2022-04-08 08:20:20,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3196#false} is VALID [2022-04-08 08:20:20,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2022-04-08 08:20:20,377 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-08 08:20:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:20,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014209725] [2022-04-08 08:20:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014209725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:20,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:20,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755353102] [2022-04-08 08:20:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755353102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97255865] [2022-04-08 08:20:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:20:20,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:20,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:20,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:20,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:20,392 INFO L87 Difference]: Start difference. First operand 123 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,512 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-08 08:20:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:20:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:20:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 08:20:20,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 08:20:20,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,587 INFO L225 Difference]: With dead ends: 227 [2022-04-08 08:20:20,587 INFO L226 Difference]: Without dead ends: 225 [2022-04-08 08:20:20,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:20,588 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:20,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-08 08:20:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-08 08:20:20,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:20,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,605 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,605 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,610 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-08 08:20:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-08 08:20:20,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:20,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:20,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-08 08:20:20,611 INFO L87 Difference]: Start difference. First operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-08 08:20:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:20,616 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-08 08:20:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-08 08:20:20,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:20,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:20,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:20,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-08 08:20:20,620 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-08 08:20:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:20,620 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-08 08:20:20,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 285 transitions. [2022-04-08 08:20:20,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-08 08:20:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:20:20,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:20,884 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:20,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:20:20,884 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-08 08:20:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516202230] [2022-04-08 08:20:20,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 2 times [2022-04-08 08:20:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525228396] [2022-04-08 08:20:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:20,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4445#true} is VALID [2022-04-08 08:20:20,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-08 08:20:20,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-08 08:20:20,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {4445#true} call ULTIMATE.init(); {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:20,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {4451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4445#true} is VALID [2022-04-08 08:20:20,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-08 08:20:20,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-08 08:20:20,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {4445#true} call #t~ret14 := main(); {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {4445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {4445#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {4445#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {4445#true} assume !(0 != ~p1~0); {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {4445#true} assume !(0 != ~p2~0); {4445#true} is VALID [2022-04-08 08:20:20,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#true} assume !(0 != ~p3~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-08 08:20:20,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p3~0; {4446#false} is VALID [2022-04-08 08:20:20,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#false} assume 1 != ~lk3~0; {4446#false} is VALID [2022-04-08 08:20:20,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#false} assume !false; {4446#false} is VALID [2022-04-08 08:20:20,932 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-08 08:20:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:20,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525228396] [2022-04-08 08:20:20,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525228396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:20,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:20,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:20,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516202230] [2022-04-08 08:20:20,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516202230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:20,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:20,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099912169] [2022-04-08 08:20:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:20:20,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:20,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:20,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:20,946 INFO L87 Difference]: Start difference. First operand 167 states and 285 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,088 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-08 08:20:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:20:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 08:20:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-08 08:20:21,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-08 08:20:21,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:21,205 INFO L225 Difference]: With dead ends: 391 [2022-04-08 08:20:21,205 INFO L226 Difference]: Without dead ends: 233 [2022-04-08 08:20:21,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:21,207 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:21,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-08 08:20:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-08 08:20:21,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:21,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,221 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,222 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,229 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-08 08:20:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-08 08:20:21,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-08 08:20:21,230 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-08 08:20:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,237 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-08 08:20:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-08 08:20:21,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:21,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-08 08:20:21,245 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-08 08:20:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:21,246 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-08 08:20:21,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 391 transitions. [2022-04-08 08:20:21,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-08 08:20:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:20:21,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:21,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:21,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:20:21,586 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-08 08:20:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:21,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406908574] [2022-04-08 08:20:21,587 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 2 times [2022-04-08 08:20:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:21,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024206584] [2022-04-08 08:20:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:21,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-08 08:20:21,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-08 08:20:21,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-08 08:20:21,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:21,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {6173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6167#true} is VALID [2022-04-08 08:20:21,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret14 := main(); {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {6167#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#true} assume !(0 != ~p1~0); {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {6167#true} assume !(0 != ~p2~0); {6167#true} is VALID [2022-04-08 08:20:21,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {6167#true} assume 0 != ~p3~0;~lk3~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {6172#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6172#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:20:21,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6168#false} is VALID [2022-04-08 08:20:21,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#false} assume 0 != ~p4~0; {6168#false} is VALID [2022-04-08 08:20:21,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume 1 != ~lk4~0; {6168#false} is VALID [2022-04-08 08:20:21,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-08 08:20:21,664 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-08 08:20:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024206584] [2022-04-08 08:20:21,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024206584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:21,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:21,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:21,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406908574] [2022-04-08 08:20:21,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406908574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:21,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:21,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635979411] [2022-04-08 08:20:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:21,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:21,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:21,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:21,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:21,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:21,679 INFO L87 Difference]: Start difference. First operand 231 states and 391 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,835 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-08 08:20:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:20:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 08:20:21,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 08:20:21,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:21,934 INFO L225 Difference]: With dead ends: 349 [2022-04-08 08:20:21,934 INFO L226 Difference]: Without dead ends: 239 [2022-04-08 08:20:21,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:21,935 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:21,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-08 08:20:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-08 08:20:21,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:21,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,947 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,947 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,951 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-08 08:20:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-08 08:20:21,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-08 08:20:21,952 INFO L87 Difference]: Start difference. First operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-08 08:20:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,955 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-08 08:20:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-08 08:20:21,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:21,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-08 08:20:21,960 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-08 08:20:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:21,961 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-08 08:20:21,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:21,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 395 transitions. [2022-04-08 08:20:22,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-08 08:20:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:20:22,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:22,279 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:22,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:20:22,279 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-08 08:20:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534880232] [2022-04-08 08:20:22,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 2 times [2022-04-08 08:20:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207180902] [2022-04-08 08:20:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:22,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7829#true} is VALID [2022-04-08 08:20:22,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-08 08:20:22,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-08 08:20:22,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {7829#true} call ULTIMATE.init(); {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:22,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {7835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7829#true} is VALID [2022-04-08 08:20:22,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-08 08:20:22,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-08 08:20:22,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {7829#true} call #t~ret14 := main(); {7829#true} is VALID [2022-04-08 08:20:22,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {7829#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {7829#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {7829#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {7829#true} assume !(0 != ~p1~0); {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {7829#true} assume !(0 != ~p2~0); {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {7829#true} assume !(0 != ~p3~0); {7829#true} is VALID [2022-04-08 08:20:22,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {7829#true} assume 0 != ~p4~0;~lk4~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7834#(= main_~lk4~0 1)} is VALID [2022-04-08 08:20:22,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {7834#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7830#false} is VALID [2022-04-08 08:20:22,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {7830#false} assume !false; {7830#false} is VALID [2022-04-08 08:20:22,336 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-08 08:20:22,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207180902] [2022-04-08 08:20:22,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207180902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:22,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:22,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:22,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534880232] [2022-04-08 08:20:22,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534880232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:22,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:22,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775103345] [2022-04-08 08:20:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:22,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:22,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:22,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:22,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:22,351 INFO L87 Difference]: Start difference. First operand 237 states and 395 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:22,516 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-08 08:20:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 08:20:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-08 08:20:22,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-08 08:20:22,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:22,590 INFO L225 Difference]: With dead ends: 429 [2022-04-08 08:20:22,590 INFO L226 Difference]: Without dead ends: 427 [2022-04-08 08:20:22,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:22,591 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:22,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-08 08:20:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-08 08:20:22,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:22,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,607 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,607 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:22,615 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-08 08:20:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-08 08:20:22,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:22,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:22,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-08 08:20:22,616 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-08 08:20:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:22,624 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-08 08:20:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-08 08:20:22,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:22,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:22,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:22,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-08 08:20:22,631 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-08 08:20:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:22,631 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-08 08:20:22,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:22,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 539 transitions. [2022-04-08 08:20:23,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-08 08:20:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:20:23,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:23,059 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:23,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:20:23,059 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-08 08:20:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:23,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033106893] [2022-04-08 08:20:23,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 2 times [2022-04-08 08:20:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:23,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499240588] [2022-04-08 08:20:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:23,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-08 08:20:23,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-08 08:20:23,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-08 08:20:23,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:23,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {10217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-08 08:20:23,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-08 08:20:23,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-08 08:20:23,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret14 := main(); {10211#true} is VALID [2022-04-08 08:20:23,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {10211#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {10211#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} assume !(0 != ~p1~0); {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 != ~p2~0); {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume !(0 != ~p3~0); {10211#true} is VALID [2022-04-08 08:20:23,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {10211#true} assume !(0 != ~p4~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-08 08:20:23,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p4~0; {10212#false} is VALID [2022-04-08 08:20:23,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {10212#false} assume 1 != ~lk4~0; {10212#false} is VALID [2022-04-08 08:20:23,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-08 08:20:23,113 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-08 08:20:23,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499240588] [2022-04-08 08:20:23,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499240588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:23,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:23,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:23,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033106893] [2022-04-08 08:20:23,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033106893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:23,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:23,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004303846] [2022-04-08 08:20:23,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:23,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:23,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:23,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:23,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:23,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:23,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:23,126 INFO L87 Difference]: Start difference. First operand 329 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:23,276 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-08 08:20:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:20:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 08:20:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-08 08:20:23,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-08 08:20:23,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:23,385 INFO L225 Difference]: With dead ends: 765 [2022-04-08 08:20:23,385 INFO L226 Difference]: Without dead ends: 451 [2022-04-08 08:20:23,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:23,386 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:23,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-08 08:20:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-08 08:20:23,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:23,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,415 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,416 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:23,425 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-08 08:20:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-08 08:20:23,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:23,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:23,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-08 08:20:23,427 INFO L87 Difference]: Start difference. First operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-08 08:20:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:23,436 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-08 08:20:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-08 08:20:23,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:23,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:23,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:23,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-08 08:20:23,447 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-08 08:20:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:23,447 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-08 08:20:23,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:23,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 449 states and 727 transitions. [2022-04-08 08:20:24,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-08 08:20:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:20:24,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:24,114 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:24,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:20:24,114 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-08 08:20:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588454571] [2022-04-08 08:20:24,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 2 times [2022-04-08 08:20:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058991227] [2022-04-08 08:20:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:24,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13553#true} is VALID [2022-04-08 08:20:24,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-08 08:20:24,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {13553#true} call ULTIMATE.init(); {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {13559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {13553#true} call #t~ret14 := main(); {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {13553#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {13553#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {13553#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume !(0 != ~p1~0); {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume !(0 != ~p2~0); {13553#true} is VALID [2022-04-08 08:20:24,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#true} assume !(0 != ~p3~0); {13553#true} is VALID [2022-04-08 08:20:24,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#true} assume 0 != ~p4~0;~lk4~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {13558#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {13558#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:20:24,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13554#false} is VALID [2022-04-08 08:20:24,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {13554#false} assume 0 != ~p5~0; {13554#false} is VALID [2022-04-08 08:20:24,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {13554#false} assume 1 != ~lk5~0; {13554#false} is VALID [2022-04-08 08:20:24,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-04-08 08:20:24,163 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-08 08:20:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058991227] [2022-04-08 08:20:24,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058991227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:24,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:24,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:24,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:24,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588454571] [2022-04-08 08:20:24,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588454571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:24,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:24,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275675359] [2022-04-08 08:20:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:24,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:24,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,176 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-08 08:20:24,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:24,176 INFO L87 Difference]: Start difference. First operand 449 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:24,330 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-08 08:20:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:24,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-08 08:20:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-08 08:20:24,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-08 08:20:24,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:24,448 INFO L225 Difference]: With dead ends: 673 [2022-04-08 08:20:24,448 INFO L226 Difference]: Without dead ends: 459 [2022-04-08 08:20:24,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:24,449 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:24,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-08 08:20:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-08 08:20:24,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:24,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,473 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,473 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:24,481 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-08 08:20:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-08 08:20:24,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:24,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:24,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-08 08:20:24,483 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-08 08:20:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:24,491 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-08 08:20:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-08 08:20:24,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:24,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:24,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:24,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-08 08:20:24,502 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-08 08:20:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:24,503 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-08 08:20:24,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:24,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 727 transitions. [2022-04-08 08:20:25,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-08 08:20:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:20:25,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:25,153 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:25,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:20:25,153 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-08 08:20:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24177192] [2022-04-08 08:20:25,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 2 times [2022-04-08 08:20:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235072248] [2022-04-08 08:20:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:25,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:25,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16743#true} is VALID [2022-04-08 08:20:25,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-08 08:20:25,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-08 08:20:25,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {16743#true} call ULTIMATE.init(); {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:25,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {16749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {16743#true} call #t~ret14 := main(); {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {16743#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {16743#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {16743#true} assume !(0 != ~p1~0); {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {16743#true} assume !(0 != ~p2~0); {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {16743#true} assume !(0 != ~p3~0); {16743#true} is VALID [2022-04-08 08:20:25,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {16743#true} assume !(0 != ~p4~0); {16743#true} is VALID [2022-04-08 08:20:25,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#true} assume 0 != ~p5~0;~lk5~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16748#(= main_~lk5~0 1)} is VALID [2022-04-08 08:20:25,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16744#false} is VALID [2022-04-08 08:20:25,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {16744#false} assume !false; {16744#false} is VALID [2022-04-08 08:20:25,198 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-08 08:20:25,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235072248] [2022-04-08 08:20:25,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235072248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:25,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:25,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:25,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24177192] [2022-04-08 08:20:25,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24177192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:25,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:25,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966198435] [2022-04-08 08:20:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:25,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:25,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,211 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-08 08:20:25,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:25,211 INFO L87 Difference]: Start difference. First operand 457 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:25,406 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-08 08:20:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 08:20:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-08 08:20:25,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-08 08:20:25,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:25,515 INFO L225 Difference]: With dead ends: 813 [2022-04-08 08:20:25,515 INFO L226 Difference]: Without dead ends: 811 [2022-04-08 08:20:25,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:25,516 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:25,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-08 08:20:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-08 08:20:25,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:25,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,571 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,572 INFO L87 Difference]: Start difference. First operand 811 states. Second operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:25,602 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-08 08:20:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-08 08:20:25,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:25,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:25,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 811 states. [2022-04-08 08:20:25,606 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 811 states. [2022-04-08 08:20:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:25,629 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-08 08:20:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-08 08:20:25,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:25,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:25,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:25,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-08 08:20:25,654 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-08 08:20:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:25,654 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-08 08:20:25,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:25,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1007 transitions. [2022-04-08 08:20:26,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1007 edges. 1007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-08 08:20:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:20:26,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:26,569 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:26,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:20:26,569 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-08 08:20:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:26,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055074253] [2022-04-08 08:20:26,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 2 times [2022-04-08 08:20:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:26,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975412660] [2022-04-08 08:20:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:26,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21301#true} is VALID [2022-04-08 08:20:26,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-08 08:20:26,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-08 08:20:26,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {21301#true} call ULTIMATE.init(); {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:26,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {21307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {21301#true} call #t~ret14 := main(); {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {21301#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {21301#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {21301#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {21301#true} assume !(0 != ~p1~0); {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {21301#true} assume !(0 != ~p2~0); {21301#true} is VALID [2022-04-08 08:20:26,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {21301#true} assume !(0 != ~p3~0); {21301#true} is VALID [2022-04-08 08:20:26,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {21301#true} assume !(0 != ~p4~0); {21301#true} is VALID [2022-04-08 08:20:26,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {21301#true} assume !(0 != ~p5~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p1~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p2~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p3~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p4~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-08 08:20:26,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p5~0; {21302#false} is VALID [2022-04-08 08:20:26,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {21302#false} assume 1 != ~lk5~0; {21302#false} is VALID [2022-04-08 08:20:26,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {21302#false} assume !false; {21302#false} is VALID [2022-04-08 08:20:26,625 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-08 08:20:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975412660] [2022-04-08 08:20:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975412660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:26,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:26,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:26,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055074253] [2022-04-08 08:20:26,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055074253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:26,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:26,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047916892] [2022-04-08 08:20:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:26,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:26,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,641 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-08 08:20:26,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:26,642 INFO L87 Difference]: Start difference. First operand 649 states and 1007 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:26,909 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-08 08:20:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:20:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-08 08:20:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-08 08:20:26,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-08 08:20:27,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:27,045 INFO L225 Difference]: With dead ends: 1501 [2022-04-08 08:20:27,046 INFO L226 Difference]: Without dead ends: 875 [2022-04-08 08:20:27,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:27,048 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:27,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-08 08:20:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-08 08:20:27,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:27,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:27,106 INFO L74 IsIncluded]: Start isIncluded. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:27,107 INFO L87 Difference]: Start difference. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:27,133 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-08 08:20:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-08 08:20:27,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:27,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:27,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 875 states. [2022-04-08 08:20:27,137 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 875 states. [2022-04-08 08:20:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:27,161 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-08 08:20:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-08 08:20:27,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:27,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:27,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:27,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-08 08:20:27,196 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-08 08:20:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:27,196 INFO L478 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-08 08:20:27,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:27,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 873 states and 1335 transitions. [2022-04-08 08:20:28,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1335 edges. 1335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-08 08:20:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:20:28,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:28,372 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:28,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:20:28,372 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-08 08:20:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:28,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411373688] [2022-04-08 08:20:28,373 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 2 times [2022-04-08 08:20:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:28,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763699681] [2022-04-08 08:20:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:28,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:28,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27811#true} is VALID [2022-04-08 08:20:28,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-08 08:20:28,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-08 08:20:28,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {27811#true} call ULTIMATE.init(); {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:28,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27811#true} is VALID [2022-04-08 08:20:28,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {27811#true} call #t~ret14 := main(); {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {27811#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {27811#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {27811#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {27811#true} assume !(0 != ~p1~0); {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {27811#true} assume !(0 != ~p2~0); {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {27811#true} assume !(0 != ~p3~0); {27811#true} is VALID [2022-04-08 08:20:28,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {27811#true} assume !(0 != ~p4~0); {27811#true} is VALID [2022-04-08 08:20:28,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {27811#true} assume 0 != ~p5~0;~lk5~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {27816#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {27816#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {27812#false} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {27812#false} assume 0 != ~p6~0; {27812#false} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {27812#false} assume 1 != ~lk6~0; {27812#false} is VALID [2022-04-08 08:20:28,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {27812#false} assume !false; {27812#false} is VALID [2022-04-08 08:20:28,412 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-08 08:20:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763699681] [2022-04-08 08:20:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763699681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:28,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:28,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:28,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411373688] [2022-04-08 08:20:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411373688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:28,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:28,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054638561] [2022-04-08 08:20:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:28,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:28,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,431 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-08 08:20:28,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:28,431 INFO L87 Difference]: Start difference. First operand 873 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:28,680 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-08 08:20:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-08 08:20:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-08 08:20:28,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-08 08:20:28,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:28,801 INFO L225 Difference]: With dead ends: 1309 [2022-04-08 08:20:28,801 INFO L226 Difference]: Without dead ends: 891 [2022-04-08 08:20:28,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:28,802 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:28,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-08 08:20:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-08 08:20:28,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:28,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,853 INFO L74 IsIncluded]: Start isIncluded. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,854 INFO L87 Difference]: Start difference. First operand 891 states. Second operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:28,876 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-08 08:20:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-08 08:20:28,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:28,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:28,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 891 states. [2022-04-08 08:20:28,878 INFO L87 Difference]: Start difference. First operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 891 states. [2022-04-08 08:20:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:28,901 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-08 08:20:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-08 08:20:28,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:28,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:28,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:28,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-08 08:20:28,942 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-08 08:20:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:28,942 INFO L478 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-08 08:20:28,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:28,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 889 states and 1335 transitions. [2022-04-08 08:20:30,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1335 edges. 1335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-08 08:20:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:20:30,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:30,093 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:30,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:20:30,095 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-08 08:20:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389173389] [2022-04-08 08:20:30,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 2 times [2022-04-08 08:20:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:30,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695616977] [2022-04-08 08:20:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:30,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {34001#true} call ULTIMATE.init(); {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:30,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {34007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {34001#true} call #t~ret14 := main(); {34001#true} is VALID [2022-04-08 08:20:30,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {34001#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {34001#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {34001#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 != ~p1~0); {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume !(0 != ~p2~0); {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {34001#true} assume !(0 != ~p3~0); {34001#true} is VALID [2022-04-08 08:20:30,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {34001#true} assume !(0 != ~p4~0); {34001#true} is VALID [2022-04-08 08:20:30,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {34001#true} assume !(0 != ~p5~0); {34001#true} is VALID [2022-04-08 08:20:30,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {34001#true} assume 0 != ~p6~0;~lk6~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p6~0; {34006#(= main_~lk6~0 1)} is VALID [2022-04-08 08:20:30,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {34006#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {34002#false} is VALID [2022-04-08 08:20:30,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-08 08:20:30,152 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-08 08:20:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695616977] [2022-04-08 08:20:30,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695616977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:30,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:30,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:30,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389173389] [2022-04-08 08:20:30,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389173389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:30,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:30,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696773577] [2022-04-08 08:20:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:30,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:30,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,166 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-08 08:20:30,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:30,167 INFO L87 Difference]: Start difference. First operand 889 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:30,458 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-08 08:20:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:20:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:20:30,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 08:20:30,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:30,625 INFO L225 Difference]: With dead ends: 1549 [2022-04-08 08:20:30,626 INFO L226 Difference]: Without dead ends: 1547 [2022-04-08 08:20:30,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:30,626 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:30,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-08 08:20:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-08 08:20:30,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:30,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,708 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,709 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:30,771 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-08 08:20:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-08 08:20:30,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:30,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:30,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-08 08:20:30,775 INFO L87 Difference]: Start difference. First operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-08 08:20:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:30,837 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-08 08:20:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-08 08:20:30,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:30,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:30,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:30,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-08 08:20:30,908 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-08 08:20:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:30,908 INFO L478 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-08 08:20:30,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:30,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1289 states and 1879 transitions. [2022-04-08 08:20:32,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1879 edges. 1879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-08 08:20:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:20:32,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:32,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:32,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:20:32,568 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-08 08:20:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:32,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644333151] [2022-04-08 08:20:32,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 2 times [2022-04-08 08:20:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:32,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385281204] [2022-04-08 08:20:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:32,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42783#true} is VALID [2022-04-08 08:20:32,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-08 08:20:32,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {42783#true} call ULTIMATE.init(); {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {42789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {42783#true} call #t~ret14 := main(); {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {42783#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {42783#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {42783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {42783#true} assume !(0 != ~p1~0); {42783#true} is VALID [2022-04-08 08:20:32,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {42783#true} assume !(0 != ~p2~0); {42783#true} is VALID [2022-04-08 08:20:32,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {42783#true} assume !(0 != ~p3~0); {42783#true} is VALID [2022-04-08 08:20:32,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {42783#true} assume !(0 != ~p4~0); {42783#true} is VALID [2022-04-08 08:20:32,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {42783#true} assume !(0 != ~p5~0); {42783#true} is VALID [2022-04-08 08:20:32,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {42783#true} assume !(0 != ~p6~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p1~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p2~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p3~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p4~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p5~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-08 08:20:32,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p6~0; {42784#false} is VALID [2022-04-08 08:20:32,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {42784#false} assume 1 != ~lk6~0; {42784#false} is VALID [2022-04-08 08:20:32,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {42784#false} assume !false; {42784#false} is VALID [2022-04-08 08:20:32,606 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-08 08:20:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:32,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385281204] [2022-04-08 08:20:32,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385281204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:32,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:32,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:32,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644333151] [2022-04-08 08:20:32,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644333151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:32,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878011628] [2022-04-08 08:20:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:32,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:32,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:32,621 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-08 08:20:32,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:32,621 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:33,180 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-08 08:20:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:20:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:20:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:20:33,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 08:20:33,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:33,392 INFO L225 Difference]: With dead ends: 2957 [2022-04-08 08:20:33,392 INFO L226 Difference]: Without dead ends: 1707 [2022-04-08 08:20:33,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:33,394 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:33,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-08 08:20:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-08 08:20:33,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:33,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,504 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:33,581 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-08 08:20:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-08 08:20:33,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:33,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:33,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1707 states. [2022-04-08 08:20:33,586 INFO L87 Difference]: Start difference. First operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1707 states. [2022-04-08 08:20:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:33,660 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-08 08:20:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-08 08:20:33,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:33,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:33,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:33,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-08 08:20:33,796 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-08 08:20:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:33,796 INFO L478 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-08 08:20:33,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1705 states and 2439 transitions. [2022-04-08 08:20:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2439 edges. 2439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-08 08:20:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:36,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:36,018 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:36,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:20:36,018 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-08 08:20:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:36,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620694714] [2022-04-08 08:20:36,023 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:36,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 2 times [2022-04-08 08:20:36,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:36,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107597898] [2022-04-08 08:20:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:36,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {55533#true} is VALID [2022-04-08 08:20:36,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-08 08:20:36,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-08 08:20:36,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {55533#true} call ULTIMATE.init(); {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:36,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {55539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {55533#true} call #t~ret14 := main(); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {55533#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {55533#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {55533#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {55533#true} assume !(0 != ~p1~0); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {55533#true} assume !(0 != ~p2~0); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {55533#true} assume !(0 != ~p3~0); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {55533#true} assume !(0 != ~p4~0); {55533#true} is VALID [2022-04-08 08:20:36,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {55533#true} assume !(0 != ~p5~0); {55533#true} is VALID [2022-04-08 08:20:36,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {55533#true} assume 0 != ~p6~0;~lk6~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {55538#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {55538#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:20:36,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {55534#false} is VALID [2022-04-08 08:20:36,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {55534#false} assume 0 != ~p7~0; {55534#false} is VALID [2022-04-08 08:20:36,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {55534#false} assume 1 != ~lk7~0; {55534#false} is VALID [2022-04-08 08:20:36,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {55534#false} assume !false; {55534#false} is VALID [2022-04-08 08:20:36,071 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-08 08:20:36,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:36,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107597898] [2022-04-08 08:20:36,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107597898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:36,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:36,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:36,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:36,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620694714] [2022-04-08 08:20:36,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620694714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:36,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:36,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335443081] [2022-04-08 08:20:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:36,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:36,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:36,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:36,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:36,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:36,087 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:36,584 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-08 08:20:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 08:20:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 08:20:36,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-08 08:20:36,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:36,791 INFO L225 Difference]: With dead ends: 2557 [2022-04-08 08:20:36,791 INFO L226 Difference]: Without dead ends: 1739 [2022-04-08 08:20:36,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:36,792 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:36,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-08 08:20:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-08 08:20:36,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:36,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,906 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,907 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:36,981 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-08 08:20:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-08 08:20:36,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:36,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:36,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-08 08:20:36,986 INFO L87 Difference]: Start difference. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-08 08:20:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:37,063 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-08 08:20:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-08 08:20:37,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:37,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:37,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:37,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-08 08:20:37,187 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-08 08:20:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:37,187 INFO L478 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-08 08:20:37,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:37,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1737 states and 2439 transitions. [2022-04-08 08:20:39,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2439 edges. 2439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-08 08:20:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:39,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:39,484 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:39,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:20:39,484 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-08 08:20:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798535668] [2022-04-08 08:20:39,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 2 times [2022-04-08 08:20:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515270973] [2022-04-08 08:20:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:39,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {67611#true} is VALID [2022-04-08 08:20:39,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-08 08:20:39,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {67611#true} call ULTIMATE.init(); {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {67617#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {67611#true} call #t~ret14 := main(); {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {67611#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {67611#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {67611#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {67611#true} assume !(0 != ~p1~0); {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {67611#true} assume !(0 != ~p2~0); {67611#true} is VALID [2022-04-08 08:20:39,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {67611#true} assume !(0 != ~p3~0); {67611#true} is VALID [2022-04-08 08:20:39,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {67611#true} assume !(0 != ~p4~0); {67611#true} is VALID [2022-04-08 08:20:39,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {67611#true} assume !(0 != ~p5~0); {67611#true} is VALID [2022-04-08 08:20:39,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {67611#true} assume !(0 != ~p6~0); {67611#true} is VALID [2022-04-08 08:20:39,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {67611#true} assume 0 != ~p7~0;~lk7~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p7~0; {67616#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:39,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {67616#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {67612#false} is VALID [2022-04-08 08:20:39,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {67612#false} assume !false; {67612#false} is VALID [2022-04-08 08:20:39,540 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-08 08:20:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515270973] [2022-04-08 08:20:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515270973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:39,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:39,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:39,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:39,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798535668] [2022-04-08 08:20:39,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798535668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:39,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:39,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004182295] [2022-04-08 08:20:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:39,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:39,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:39,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:39,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:39,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:39,555 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:40,196 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-08 08:20:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 08:20:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 08:20:40,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-08 08:20:40,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:40,595 INFO L225 Difference]: With dead ends: 2957 [2022-04-08 08:20:40,595 INFO L226 Difference]: Without dead ends: 2955 [2022-04-08 08:20:40,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:40,596 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:40,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-08 08:20:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-08 08:20:40,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:40,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,758 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,760 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:40,971 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-08 08:20:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-08 08:20:40,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:40,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:40,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-08 08:20:40,979 INFO L87 Difference]: Start difference. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-08 08:20:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:41,182 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-08 08:20:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-08 08:20:41,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:41,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:41,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:41,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-08 08:20:41,446 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-08 08:20:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:41,446 INFO L478 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-08 08:20:41,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:41,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2569 states and 3495 transitions. [2022-04-08 08:20:44,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3495 edges. 3495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-08 08:20:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:44,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:44,758 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:44,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:20:44,758 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-08 08:20:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:44,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946247264] [2022-04-08 08:20:44,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 2 times [2022-04-08 08:20:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:44,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571969386] [2022-04-08 08:20:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:44,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {84585#true} is VALID [2022-04-08 08:20:44,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {84585#true} call ULTIMATE.init(); {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {84591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {84585#true} call #t~ret14 := main(); {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {84585#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {84585#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {84585#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {84585#true} is VALID [2022-04-08 08:20:44,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {84585#true} assume !(0 != ~p1~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {84585#true} assume !(0 != ~p2~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {84585#true} assume !(0 != ~p3~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {84585#true} assume !(0 != ~p4~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {84585#true} assume !(0 != ~p5~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {84585#true} assume !(0 != ~p6~0); {84585#true} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {84585#true} assume !(0 != ~p7~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p1~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p2~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p3~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p4~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p5~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p6~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:44,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p7~0; {84586#false} is VALID [2022-04-08 08:20:44,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {84586#false} assume 1 != ~lk7~0; {84586#false} is VALID [2022-04-08 08:20:44,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {84586#false} assume !false; {84586#false} is VALID [2022-04-08 08:20:44,807 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-08 08:20:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:44,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571969386] [2022-04-08 08:20:44,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571969386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:44,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:44,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:44,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:44,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946247264] [2022-04-08 08:20:44,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946247264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:44,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:44,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53392462] [2022-04-08 08:20:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:44,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:44,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:44,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:44,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:44,820 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:46,460 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-08 08:20:46,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:46,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:20:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 08:20:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 08:20:46,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-08 08:20:46,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:47,055 INFO L225 Difference]: With dead ends: 5837 [2022-04-08 08:20:47,055 INFO L226 Difference]: Without dead ends: 3339 [2022-04-08 08:20:47,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:47,058 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:47,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-08 08:20:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-08 08:20:47,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:47,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:47,286 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:47,288 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:47,578 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-08 08:20:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-08 08:20:47,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:47,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:47,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-08 08:20:47,586 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-08 08:20:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:47,880 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-08 08:20:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-08 08:20:47,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:47,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:47,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:47,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-08 08:20:48,392 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-08 08:20:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:48,393 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-08 08:20:48,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:48,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 4423 transitions. [2022-04-08 08:20:52,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4423 edges. 4423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-08 08:20:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:20:52,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:52,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:52,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:20:52,550 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-08 08:20:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:52,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471178887] [2022-04-08 08:20:52,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 2 times [2022-04-08 08:20:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314791485] [2022-04-08 08:20:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:52,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {109623#true} is VALID [2022-04-08 08:20:52,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-08 08:20:52,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {109623#true} call ULTIMATE.init(); {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {109629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {109623#true} call #t~ret14 := main(); {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {109623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {109623#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {109623#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {109623#true} assume !(0 != ~p1~0); {109623#true} is VALID [2022-04-08 08:20:52,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {109623#true} assume !(0 != ~p2~0); {109623#true} is VALID [2022-04-08 08:20:52,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {109623#true} assume !(0 != ~p3~0); {109623#true} is VALID [2022-04-08 08:20:52,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {109623#true} assume !(0 != ~p4~0); {109623#true} is VALID [2022-04-08 08:20:52,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {109623#true} assume !(0 != ~p5~0); {109623#true} is VALID [2022-04-08 08:20:52,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {109623#true} assume !(0 != ~p6~0); {109623#true} is VALID [2022-04-08 08:20:52,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {109623#true} assume 0 != ~p7~0;~lk7~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {109628#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {109628#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {109628#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:52,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {109624#false} is VALID [2022-04-08 08:20:52,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {109624#false} assume 0 != ~p8~0; {109624#false} is VALID [2022-04-08 08:20:52,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {109624#false} assume 1 != ~lk8~0; {109624#false} is VALID [2022-04-08 08:20:52,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {109624#false} assume !false; {109624#false} is VALID [2022-04-08 08:20:52,603 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-08 08:20:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:52,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314791485] [2022-04-08 08:20:52,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314791485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:52,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:52,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:52,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:52,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471178887] [2022-04-08 08:20:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471178887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:52,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:52,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840878360] [2022-04-08 08:20:52,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:20:52,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:52,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:52,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:52,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:52,623 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:54,030 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-08 08:20:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:54,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:20:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:20:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:20:54,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 08:20:54,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:54,625 INFO L225 Difference]: With dead ends: 5005 [2022-04-08 08:20:54,625 INFO L226 Difference]: Without dead ends: 3403 [2022-04-08 08:20:54,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:54,627 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:54,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-08 08:20:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-08 08:20:54,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:54,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:54,863 INFO L74 IsIncluded]: Start isIncluded. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:54,865 INFO L87 Difference]: Start difference. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:55,178 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-08 08:20:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-08 08:20:55,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:55,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:55,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3403 states. [2022-04-08 08:20:55,186 INFO L87 Difference]: Start difference. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3403 states. [2022-04-08 08:20:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:55,500 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-08 08:20:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-08 08:20:55,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:55,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:55,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:55,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-08 08:20:56,077 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-08 08:20:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:56,077 INFO L478 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-08 08:20:56,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:56,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3401 states and 4423 transitions. [2022-04-08 08:21:00,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4423 edges. 4423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-08 08:21:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:21:00,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:00,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:00,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:21:00,312 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-08 08:21:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:00,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89925145] [2022-04-08 08:21:00,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 2 times [2022-04-08 08:21:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:00,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393489142] [2022-04-08 08:21:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:00,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {133253#true} is VALID [2022-04-08 08:21:00,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {133253#true} call ULTIMATE.init(); {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {133259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {133253#true} call #t~ret14 := main(); {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {133253#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {133253#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {133253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {133253#true} assume !(0 != ~p1~0); {133253#true} is VALID [2022-04-08 08:21:00,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {133253#true} assume !(0 != ~p2~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {133253#true} assume !(0 != ~p3~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {133253#true} assume !(0 != ~p4~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {133253#true} assume !(0 != ~p5~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {133253#true} assume !(0 != ~p6~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {133253#true} assume !(0 != ~p7~0); {133253#true} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {133253#true} assume 0 != ~p8~0;~lk8~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p8~0; {133258#(= main_~lk8~0 1)} is VALID [2022-04-08 08:21:00,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {133258#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {133254#false} is VALID [2022-04-08 08:21:00,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {133254#false} assume !false; {133254#false} is VALID [2022-04-08 08:21:00,342 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-08 08:21:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393489142] [2022-04-08 08:21:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393489142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:00,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89925145] [2022-04-08 08:21:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89925145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265258761] [2022-04-08 08:21:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:00,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:21:00,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:00,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:00,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:00,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:00,357 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:02,118 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-08 08:21:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:02,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:21:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:21:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:21:02,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 08:21:02,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:03,430 INFO L225 Difference]: With dead ends: 5645 [2022-04-08 08:21:03,430 INFO L226 Difference]: Without dead ends: 5643 [2022-04-08 08:21:03,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:21:03,431 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:21:03,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:21:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-08 08:21:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-08 08:21:03,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:03,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:03,801 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:03,804 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:04,559 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-08 08:21:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-08 08:21:04,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:04,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:04,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-08 08:21:04,573 INFO L87 Difference]: Start difference. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5643 states. [2022-04-08 08:21:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:05,348 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-08 08:21:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-08 08:21:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:05,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:05,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:05,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-08 08:21:06,432 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-08 08:21:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:06,432 INFO L478 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-08 08:21:06,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:06,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5129 states and 6471 transitions. [2022-04-08 08:21:12,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6471 edges. 6471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-08 08:21:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:21:12,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:12,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:12,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:21:12,719 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-08 08:21:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700240800] [2022-04-08 08:21:12,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 2 times [2022-04-08 08:21:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:12,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786413260] [2022-04-08 08:21:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:12,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {166099#true} is VALID [2022-04-08 08:21:12,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-08 08:21:12,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {166099#true} call ULTIMATE.init(); {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {166105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {166099#true} call #t~ret14 := main(); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {166099#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {166099#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {166099#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {166099#true} assume !(0 != ~p1~0); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {166099#true} assume !(0 != ~p2~0); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {166099#true} assume !(0 != ~p3~0); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {166099#true} assume !(0 != ~p4~0); {166099#true} is VALID [2022-04-08 08:21:12,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {166099#true} assume !(0 != ~p5~0); {166099#true} is VALID [2022-04-08 08:21:12,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {166099#true} assume !(0 != ~p6~0); {166099#true} is VALID [2022-04-08 08:21:12,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {166099#true} assume !(0 != ~p7~0); {166099#true} is VALID [2022-04-08 08:21:12,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {166099#true} assume !(0 != ~p8~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p1~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p2~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p3~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p4~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p5~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p6~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p7~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-08 08:21:12,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p8~0; {166100#false} is VALID [2022-04-08 08:21:12,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {166100#false} assume 1 != ~lk8~0; {166100#false} is VALID [2022-04-08 08:21:12,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {166100#false} assume !false; {166100#false} is VALID [2022-04-08 08:21:12,764 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-08 08:21:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786413260] [2022-04-08 08:21:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786413260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:12,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700240800] [2022-04-08 08:21:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700240800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847428181] [2022-04-08 08:21:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:21:12,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:12,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:12,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:12,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:12,781 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:18,649 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-08 08:21:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:21:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-08 08:21:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-08 08:21:18,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-08 08:21:18,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:20,664 INFO L225 Difference]: With dead ends: 11533 [2022-04-08 08:21:20,665 INFO L226 Difference]: Without dead ends: 6539 [2022-04-08 08:21:20,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:21:20,670 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:21:20,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:21:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-08 08:21:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-08 08:21:21,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:21,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:21,133 INFO L74 IsIncluded]: Start isIncluded. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:21,137 INFO L87 Difference]: Start difference. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:22,218 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-08 08:21:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-08 08:21:22,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:22,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:22,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6539 states. [2022-04-08 08:21:22,233 INFO L87 Difference]: Start difference. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6539 states. [2022-04-08 08:21:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:23,345 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-08 08:21:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-08 08:21:23,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:23,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:23,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-08 08:21:25,288 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-08 08:21:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:25,288 INFO L478 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-08 08:21:25,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:25,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6537 states and 7943 transitions. [2022-04-08 08:21:32,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7943 edges. 7943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-08 08:21:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:21:32,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:32,955 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:32,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:21:32,955 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-08 08:21:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539261227] [2022-04-08 08:21:32,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 2 times [2022-04-08 08:21:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:32,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530561720] [2022-04-08 08:21:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:32,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {215329#true} is VALID [2022-04-08 08:21:32,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-08 08:21:32,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-08 08:21:32,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {215329#true} call ULTIMATE.init(); {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:32,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {215335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {215329#true} is VALID [2022-04-08 08:21:32,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-08 08:21:32,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {215329#true} call #t~ret14 := main(); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {215329#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {215329#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {215329#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {215329#true} assume !(0 != ~p1~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {215329#true} assume !(0 != ~p2~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {215329#true} assume !(0 != ~p3~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {215329#true} assume !(0 != ~p4~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {215329#true} assume !(0 != ~p5~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {215329#true} assume !(0 != ~p6~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {215329#true} assume !(0 != ~p7~0); {215329#true} is VALID [2022-04-08 08:21:32,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {215329#true} assume 0 != ~p8~0;~lk8~0 := 1; {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {215334#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {215334#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {215330#false} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {215330#false} assume 0 != ~p9~0; {215330#false} is VALID [2022-04-08 08:21:33,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {215330#false} assume 1 != ~lk9~0; {215330#false} is VALID [2022-04-08 08:21:33,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {215330#false} assume !false; {215330#false} is VALID [2022-04-08 08:21:33,002 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-08 08:21:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:33,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530561720] [2022-04-08 08:21:33,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530561720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:33,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:33,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:33,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:33,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539261227] [2022-04-08 08:21:33,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539261227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:33,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:33,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963788704] [2022-04-08 08:21:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:33,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:21:33,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:33,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:33,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:33,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:33,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:33,016 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:37,448 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-08 08:21:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:21:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:21:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:21:37,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-08 08:21:37,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:39,477 INFO L225 Difference]: With dead ends: 9805 [2022-04-08 08:21:39,477 INFO L226 Difference]: Without dead ends: 6667 [2022-04-08 08:21:39,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:21:39,480 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:21:39,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:21:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-08 08:21:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-08 08:21:39,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:39,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:39,954 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:39,957 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:41,154 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-08 08:21:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-08 08:21:41,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:41,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:41,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6667 states. [2022-04-08 08:21:41,167 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6667 states. [2022-04-08 08:21:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:42,342 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-08 08:21:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-08 08:21:42,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:42,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:42,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:42,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-08 08:21:44,379 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-08 08:21:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:44,380 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-08 08:21:44,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:44,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 7943 transitions. [2022-04-08 08:21:52,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7943 edges. 7943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-08 08:21:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:21:52,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:52,107 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:52,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:21:52,107 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-08 08:21:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258380844] [2022-04-08 08:21:52,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 2 times [2022-04-08 08:21:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992172445] [2022-04-08 08:21:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:52,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {261615#true} is VALID [2022-04-08 08:21:52,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-08 08:21:52,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-08 08:21:52,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {261615#true} call ULTIMATE.init(); {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {261621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {261615#true} call #t~ret14 := main(); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {261615#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {261615#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {261615#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {261615#true} assume !(0 != ~p1~0); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {261615#true} assume !(0 != ~p2~0); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {261615#true} assume !(0 != ~p3~0); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {261615#true} assume !(0 != ~p4~0); {261615#true} is VALID [2022-04-08 08:21:52,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {261615#true} assume !(0 != ~p5~0); {261615#true} is VALID [2022-04-08 08:21:52,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {261615#true} assume !(0 != ~p6~0); {261615#true} is VALID [2022-04-08 08:21:52,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {261615#true} assume !(0 != ~p7~0); {261615#true} is VALID [2022-04-08 08:21:52,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {261615#true} assume !(0 != ~p8~0); {261615#true} is VALID [2022-04-08 08:21:52,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {261615#true} assume 0 != ~p9~0;~lk9~0 := 1; {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {261620#(= main_~lk9~0 1)} assume 0 != ~p9~0; {261620#(= main_~lk9~0 1)} is VALID [2022-04-08 08:21:52,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {261620#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {261616#false} is VALID [2022-04-08 08:21:52,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {261616#false} assume !false; {261616#false} is VALID [2022-04-08 08:21:52,145 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-08 08:21:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:52,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992172445] [2022-04-08 08:21:52,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992172445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:52,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:52,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258380844] [2022-04-08 08:21:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258380844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:52,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689711183] [2022-04-08 08:21:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:21:52,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:52,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:52,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:52,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:52,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:52,162 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:57,682 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-08 08:21:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:21:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-08 08:21:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-08 08:21:57,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-08 08:21:57,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:02,470 INFO L225 Difference]: With dead ends: 10763 [2022-04-08 08:22:02,470 INFO L226 Difference]: Without dead ends: 10761 [2022-04-08 08:22:02,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:22:02,472 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:22:02,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:22:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-08 08:22:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-08 08:22:03,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:22:03,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:03,251 INFO L74 IsIncluded]: Start isIncluded. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:03,258 INFO L87 Difference]: Start difference. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:06,003 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-08 08:22:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-08 08:22:06,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:06,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:06,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10761 states. [2022-04-08 08:22:06,030 INFO L87 Difference]: Start difference. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10761 states. [2022-04-08 08:22:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:08,806 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-08 08:22:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-08 08:22:08,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:08,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:08,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:22:08,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:22:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-08 08:22:13,255 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-08 08:22:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:22:13,255 INFO L478 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-08 08:22:13,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:13,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10249 states and 11911 transitions. [2022-04-08 08:22:25,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11911 edges. 11911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-08 08:22:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:22:25,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:22:25,450 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:22:25,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:22:25,450 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:22:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:22:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-08 08:22:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:25,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517925089] [2022-04-08 08:22:25,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:22:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 2 times [2022-04-08 08:22:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:22:25,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954760785] [2022-04-08 08:22:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:22:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:22:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:22:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:25,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {325173#true} is VALID [2022-04-08 08:22:25,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {325173#true} call ULTIMATE.init(); {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:22:25,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {325179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {325173#true} call #t~ret14 := main(); {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {325173#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;havoc ~cond~0; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {325173#true} assume !false;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~cond~0 := #t~nondet13;havoc #t~nondet13; {325173#true} is VALID [2022-04-08 08:22:25,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {325173#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {325173#true} assume !(0 != ~p1~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {325173#true} assume !(0 != ~p2~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {325173#true} assume !(0 != ~p3~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {325173#true} assume !(0 != ~p4~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {325173#true} assume !(0 != ~p5~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {325173#true} assume !(0 != ~p6~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {325173#true} assume !(0 != ~p7~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {325173#true} assume !(0 != ~p8~0); {325173#true} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {325173#true} assume !(0 != ~p9~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p1~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p2~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p3~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p4~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p5~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p6~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p7~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p8~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {325178#(= main_~p9~0 0)} assume 0 != ~p9~0; {325174#false} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {325174#false} assume 1 != ~lk9~0; {325174#false} is VALID [2022-04-08 08:22:25,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {325174#false} assume !false; {325174#false} is VALID [2022-04-08 08:22:25,496 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-08 08:22:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:22:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954760785] [2022-04-08 08:22:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954760785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:25,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:25,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:25,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:22:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517925089] [2022-04-08 08:22:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517925089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:25,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:25,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635270627] [2022-04-08 08:22:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:22:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:22:25,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:22:25,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:25,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:25,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:22:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:22:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:22:25,512 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:47,209 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-08 08:22:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:22:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:22:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:22:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:22:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:22:47,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-08 08:22:47,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:47,293 INFO L225 Difference]: With dead ends: 22793 [2022-04-08 08:22:47,293 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:22:47,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:22:47,317 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:22:47,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:22:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:22:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:22:47,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:22:47,318 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-08 08:22:47,318 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-08 08:22:47,318 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-08 08:22:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:47,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:22:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:22:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:47,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:47,318 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-08 08:22:47,318 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-08 08:22:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:47,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:22:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:22:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:47,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:22:47,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:22:47,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:22:47,319 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-08 08:22:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:22:47,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 08:22:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:22:47,319 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:22:47,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:47,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:22:47,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:22:47,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:22:47,322 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:22:47,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:22:47,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:22:56,578 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 573 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:23:03,034 WARN L232 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 688 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:23:53,444 WARN L232 SmtUtils]: Spent 37.05s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:24:39,308 WARN L232 SmtUtils]: Spent 37.37s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:24:44,342 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 497 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:25:02,613 WARN L232 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 1071 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:25:17,621 WARN L232 SmtUtils]: Spent 15.01s on a formula simplification that was a NOOP. DAG size: 657 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:25:46,267 WARN L232 SmtUtils]: Spent 28.64s on a formula simplification that was a NOOP. DAG size: 1329 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:26:02,862 WARN L232 SmtUtils]: Spent 12.84s on a formula simplification that was a NOOP. DAG size: 609 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:26:17,650 WARN L232 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:26:29,176 WARN L232 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 689 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:26:47,340 WARN L232 SmtUtils]: Spent 18.16s on a formula simplification that was a NOOP. DAG size: 753 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:27:10,359 WARN L232 SmtUtils]: Spent 23.02s on a formula simplification that was a NOOP. DAG size: 945 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:27:20,372 WARN L232 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:27:25,803 WARN L232 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 298 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:27:35,581 WARN L232 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 562 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:27:47,927 WARN L232 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 682 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:27:59,726 WARN L232 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 582 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:05,129 WARN L232 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 548 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:13,519 WARN L232 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 616 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:19,045 WARN L232 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 554 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:26,285 WARN L232 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 543 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:32,149 WARN L232 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 564 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:38,362 WARN L232 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 1056 DAG size of output: 3 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:44,369 WARN L232 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 642 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:28:54,619 WARN L232 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 1314 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:29:08,396 WARN L232 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 302 DAG size of output: 296 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:29:14,621 WARN L232 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 594 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:29:49,253 WARN L232 SmtUtils]: Spent 32.72s on a formula simplification. DAG size of input: 558 DAG size of output: 551 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:05,469 WARN L232 SmtUtils]: Spent 16.19s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:20,657 WARN L232 SmtUtils]: Spent 15.17s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:29,674 WARN L232 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 738 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:36,697 WARN L232 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 930 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:44,013 WARN L232 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 570 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:30:44,021 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 08:30:44,021 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 08:30:44,021 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:30:44,021 INFO L878 garLoopResultBuilder]: At program point L126-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse3) (and .cse0 .cse4 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse5 .cse3))) [2022-04-08 08:30:44,022 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 151) the Hoare annotation is: true [2022-04-08 08:30:44,023 INFO L878 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse16 (= main_~p6~0 0)) (.cse11 (= main_~p9~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse17 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse15 (= main_~p2~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse12 (= main_~p7~0 0)) (.cse13 (= main_~p5~0 0)) (.cse7 (= main_~lk9~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse14 (= main_~p3~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9))) [2022-04-08 08:30:44,023 INFO L878 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: (let ((.cse0 (= main_~lk8~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse1 (= main_~p9~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse6 (= main_~lk9~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse6 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse2 .cse6 .cse3 .cse4))) [2022-04-08 08:30:44,024 INFO L878 garLoopResultBuilder]: At program point L111-1(lines 38 146) the Hoare annotation is: (let ((.cse8 (= main_~lk9~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse11 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse11) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse11) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse11) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse11) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse5) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse5) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse11) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse5))) [2022-04-08 08:30:44,024 INFO L878 garLoopResultBuilder]: At program point L136-1(lines 38 146) the Hoare annotation is: (or (= main_~p9~0 0) (= main_~lk9~0 1)) [2022-04-08 08:30:44,026 INFO L878 garLoopResultBuilder]: At program point L95-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse14 (= main_~p6~0 0)) (.cse13 (= main_~lk5~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse8 (= main_~p3~0 0)) (.cse9 (= main_~lk7~0 1)) (.cse10 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse15 (= main_~p9~0 0)) (.cse17 (= main_~lk3~0 1)) (.cse12 (= main_~p1~0 0)) (.cse4 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1)) (.cse16 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse7 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse14) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse14 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16))) [2022-04-08 08:30:44,026 INFO L878 garLoopResultBuilder]: At program point L87-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-08 08:30:44,026 INFO L878 garLoopResultBuilder]: At program point L112(line 112) the Hoare annotation is: (let ((.cse13 (= main_~p9~0 0)) (.cse12 (= main_~p8~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse9 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse7) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse7))) [2022-04-08 08:30:44,026 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 08:30:44,027 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 151) the Hoare annotation is: true [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 (not (= main_~p8~0 0))) (.cse1 (= main_~lk8~0 1))) (or (and .cse0 .cse1 (= main_~lk9~0 1)) (and .cse0 .cse1 (= main_~p9~0 0)))) [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point L71-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) the Hoare annotation is: false [2022-04-08 08:30:44,027 INFO L885 garLoopResultBuilder]: At program point L63(lines 63 65) the Hoare annotation is: true [2022-04-08 08:30:44,027 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point L63-2(lines 38 146) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point L121-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk9~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse4 (= main_~p9~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse6) (and .cse1 .cse5 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse3) (and .cse0 .cse7 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse3) (and .cse0 .cse7 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse7 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse4 .cse6) (and .cse7 .cse5 .cse2 .cse3) (and .cse0 .cse7 .cse4 .cse6))) [2022-04-08 08:30:44,027 INFO L878 garLoopResultBuilder]: At program point L122(line 122) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse4 (= main_~lk9~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p9~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9))) [2022-04-08 08:30:44,027 INFO L885 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-08 08:30:44,028 INFO L878 garLoopResultBuilder]: At program point L106-1(lines 38 146) the Hoare annotation is: (let ((.cse10 (= main_~p3~0 0)) (.cse12 (= main_~lk5~0 1)) (.cse7 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse5 (= main_~lk9~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse13 (= main_~p9~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse9 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse6 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse6 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse6 .cse10) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse9 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse9) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse9) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse9 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse6 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9))) [2022-04-08 08:30:44,028 INFO L885 garLoopResultBuilder]: At program point L40(lines 40 42) the Hoare annotation is: true [2022-04-08 08:30:44,028 INFO L878 garLoopResultBuilder]: At program point L131-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p9~0 0)) (.cse2 (= main_~p8~0 0)) (.cse0 (= main_~lk8~0 1)) (.cse3 (= main_~lk9~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse0 .cse3))) [2022-04-08 08:30:44,028 INFO L878 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse8 (= main_~lk8~0 1)) (.cse14 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse12 (= main_~p5~0 0)) (.cse13 (= main_~p3~0 0)) (.cse11 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse10 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7))) [2022-04-08 08:30:44,028 INFO L878 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse3 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p9~0 0)) (.cse2 (not (= main_~p7~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse0 .cse1 .cse5 .cse2))) [2022-04-08 08:30:44,029 INFO L878 garLoopResultBuilder]: At program point L91-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L116-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse8 (= main_~lk9~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0)) (.cse7 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse6 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse8 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse3 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse9))) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-08 08:30:44,030 INFO L885 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L67-1(lines 38 146) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse9 (= main_~lk8~0 1)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~p7~0 0)) (.cse8 (= main_~lk9~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse4 (not (= main_~p4~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse11 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11))) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (= main_~lk9~0 1) [2022-04-08 08:30:44,030 INFO L878 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-08 08:30:44,031 INFO L878 garLoopResultBuilder]: At program point L101-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~lk4~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1)) (.cse13 (= main_~p3~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse11 (= main_~p4~0 0)) (.cse8 (= main_~lk8~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse14 (= main_~p5~0 0)) (.cse12 (= main_~p2~0 0)) (.cse15 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse6 .cse13) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse10 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse10) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse10))) [2022-04-08 08:30:44,033 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:30:44,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:30:44,036 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:30:44,043 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:30:44,357 INFO L163 areAnnotationChecker]: CFG has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:30:44,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:30:44 BoogieIcfgContainer [2022-04-08 08:30:44,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:30:44,363 INFO L158 Benchmark]: Toolchain (without parser) took 627571.76ms. Allocated memory was 175.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 124.3MB in the beginning and 700.1MB in the end (delta: -575.7MB). Peak memory consumption was 929.6MB. Max. memory is 8.0GB. [2022-04-08 08:30:44,363 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:30:44,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.72ms. Allocated memory is still 175.1MB. Free memory was 124.1MB in the beginning and 149.7MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 08:30:44,363 INFO L158 Benchmark]: Boogie Preprocessor took 26.14ms. Allocated memory is still 175.1MB. Free memory was 149.7MB in the beginning and 148.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:30:44,363 INFO L158 Benchmark]: RCFGBuilder took 287.31ms. Allocated memory is still 175.1MB. Free memory was 148.1MB in the beginning and 134.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 08:30:44,363 INFO L158 Benchmark]: TraceAbstraction took 627040.17ms. Allocated memory was 175.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 134.1MB in the beginning and 700.1MB in the end (delta: -566.0MB). Peak memory consumption was 939.2MB. Max. memory is 8.0GB. [2022-04-08 08:30:44,364 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 175.1MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.72ms. Allocated memory is still 175.1MB. Free memory was 124.1MB in the beginning and 149.7MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.14ms. Allocated memory is still 175.1MB. Free memory was 149.7MB in the beginning and 148.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.31ms. Allocated memory is still 175.1MB. Free memory was 148.1MB in the beginning and 134.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 627040.17ms. Allocated memory was 175.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 134.1MB in the beginning and 700.1MB in the end (delta: -566.0MB). Peak memory consumption was 939.2MB. 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: 149]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 626.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 60.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 476.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2859 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2859 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1968 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 12851 NumberOfFragments, 51244 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 273.0s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2169939 FormulaSimplificationTreeSizeReductionInter, 203.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 08:30:44,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...