/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:04:16,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:04:16,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:04:16,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:04:16,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:04:16,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:04:16,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:04:16,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:04:16,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:04:16,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:04:16,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:04:16,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:04:16,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:04:16,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:04:16,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:04:16,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:04:16,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:04:16,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:04:16,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:04:16,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:04:16,975 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:04:16,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:04:16,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:04:16,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:04:16,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:04:16,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:04:16,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:04:16,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:04:16,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:04:16,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:04:16,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:04:16,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:04:16,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:04:16,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:04:16,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:04:16,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:04:16,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:04:16,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:04:16,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:04:16,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:04:16,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:04:16,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:04:16,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:04:16,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:04:16,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:04:16,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:04:16,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:04:16,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:04:16,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:04:16,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:04:16,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:04:16,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:16,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:04:16,999 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:04:16,999 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-15 18:04:17,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:04:17,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:04:17,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:04:17,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:04:17,225 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:04:17,226 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-15 18:04:17,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce139828e/d08089ac99b9405e9224787b11180ae6/FLAG114df941e [2022-04-15 18:04:17,601 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:04:17,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-15 18:04:17,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce139828e/d08089ac99b9405e9224787b11180ae6/FLAG114df941e [2022-04-15 18:04:18,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce139828e/d08089ac99b9405e9224787b11180ae6 [2022-04-15 18:04:18,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:04:18,047 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:04:18,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:18,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:04:18,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:04:18,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf6746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18, skipping insertion in model container [2022-04-15 18:04:18,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:04:18,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:04:18,193 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-15 18:04:18,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:18,201 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:04:18,217 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-15 18:04:18,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:18,245 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:04:18,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18 WrapperNode [2022-04-15 18:04:18,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:18,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:04:18,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:04:18,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:04:18,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:04:18,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:04:18,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:04:18,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:04:18,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (1/1) ... [2022-04-15 18:04:18,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:04:18,306 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-15 18:04:18,311 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-15 18:04:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:04:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:04:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:04:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:04:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:04:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:04:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:04:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:04:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:04:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:04:18,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:04:18,429 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:04:18,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:04:18,653 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:04:18,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:04:18,659 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:04:18,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:04:18 BoogieIcfgContainer [2022-04-15 18:04:18,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:04:18,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:04:18,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:04:18,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:04:18,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:04:18" (1/3) ... [2022-04-15 18:04:18,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e205fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:04:18, skipping insertion in model container [2022-04-15 18:04:18,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:18" (2/3) ... [2022-04-15 18:04:18,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e205fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:04:18, skipping insertion in model container [2022-04-15 18:04:18,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:04:18" (3/3) ... [2022-04-15 18:04:18,665 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-15 18:04:18,668 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:04:18,668 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:04:18,696 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:04:18,700 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-15 18:04:18,700 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:04:18,712 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-15 18:04:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:04:18,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:18,717 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-15 18:04:18,718 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-15 18:04:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:18,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203613174] [2022-04-15 18:04:18,733 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 2 times [2022-04-15 18:04:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:18,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536359134] [2022-04-15 18:04:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:18,896 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-15 18:04:18,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-15 18:04:18,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-15 18:04:18,898 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-15 18:04:18,898 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-15 18:04:18,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-15 18:04:18,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-15 18:04:18,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2022-04-15 18:04:18,899 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-15 18:04:18,900 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-15 18:04:18,900 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-15 18:04:18,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 != ~p1~0;~lk1~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-15 18:04:18,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {50#(= main_~lk1~0 1)} is VALID [2022-04-15 18:04:18,902 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-15 18:04:18,902 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-15 18:04:18,903 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-15 18:04:18,903 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-15 18:04:18,904 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-15 18:04:18,905 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-15 18:04:18,906 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-15 18:04:18,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p1~0; {50#(= main_~lk1~0 1)} is VALID [2022-04-15 18:04:18,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {46#false} is VALID [2022-04-15 18:04:18,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-04-15 18:04:18,908 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-15 18:04:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:18,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536359134] [2022-04-15 18:04:18,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536359134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:18,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:18,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:18,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:18,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203613174] [2022-04-15 18:04:18,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203613174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:18,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:18,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507839430] [2022-04-15 18:04:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:18,918 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-15 18:04:18,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:18,921 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-15 18:04:18,948 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-15 18:04:18,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:18,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:18,974 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-15 18:04:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,221 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-15 18:04:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:19,222 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-15 18:04:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:19,223 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-15 18:04:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 18:04:19,230 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-15 18:04:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 18:04:19,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 18:04:19,367 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-15 18:04:19,375 INFO L225 Difference]: With dead ends: 82 [2022-04-15 18:04:19,375 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 18:04:19,376 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-15 18:04:19,378 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-15 18:04:19,379 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-15 18:04:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 18:04:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-15 18:04:19,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:19,403 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-15 18:04:19,404 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-15 18:04:19,404 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-15 18:04:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,408 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-15 18:04:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-15 18:04:19,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:19,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:19,409 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-15 18:04:19,410 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-15 18:04:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,413 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-15 18:04:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-15 18:04:19,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:19,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:19,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:19,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:19,414 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-15 18:04:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-15 18:04:19,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-15 18:04:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:19,417 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-15 18:04:19,417 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-15 18:04:19,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 82 transitions. [2022-04-15 18:04:19,477 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-15 18:04:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-15 18:04:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:04:19,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:19,478 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-15 18:04:19,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:04:19,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-15 18:04:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:19,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112184793] [2022-04-15 18:04:19,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 2 times [2022-04-15 18:04:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:19,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047893801] [2022-04-15 18:04:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:19,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:19,537 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-15 18:04:19,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-15 18:04:19,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-15 18:04:19,538 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-15 18:04:19,538 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-15 18:04:19,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-15 18:04:19,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-15 18:04:19,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret14 := main(); {449#true} is VALID [2022-04-15 18:04:19,539 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-15 18:04:19,539 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-15 18:04:19,539 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-15 18:04:19,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} assume !(0 != ~p1~0); {454#(= main_~p1~0 0)} is VALID [2022-04-15 18:04:19,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~p1~0 0)} assume !(0 != ~p2~0); {454#(= main_~p1~0 0)} is VALID [2022-04-15 18:04:19,540 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-15 18:04:19,541 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-15 18:04:19,541 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-15 18:04:19,541 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-15 18:04:19,542 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-15 18:04:19,542 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-15 18:04:19,542 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-15 18:04:19,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p1~0; {450#false} is VALID [2022-04-15 18:04:19,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume 1 != ~lk1~0; {450#false} is VALID [2022-04-15 18:04:19,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-15 18:04:19,543 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-15 18:04:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:19,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047893801] [2022-04-15 18:04:19,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047893801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:19,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:19,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:19,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:19,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112184793] [2022-04-15 18:04:19,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112184793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:19,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:19,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992579110] [2022-04-15 18:04:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:19,545 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-15 18:04:19,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:19,546 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-15 18:04:19,558 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-15 18:04:19,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:19,559 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-15 18:04:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,699 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-15 18:04:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:19,699 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-15 18:04:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:19,700 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-15 18:04:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 18:04:19,702 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-15 18:04:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 18:04:19,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-15 18:04:19,826 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-15 18:04:19,828 INFO L225 Difference]: With dead ends: 108 [2022-04-15 18:04:19,828 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 18:04:19,828 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-15 18:04:19,829 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-15 18:04:19,829 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-15 18:04:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 18:04:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-15 18:04:19,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:19,837 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-15 18:04:19,837 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-15 18:04:19,837 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-15 18:04:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,840 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-15 18:04:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-15 18:04:19,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:19,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:19,840 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-15 18:04:19,841 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-15 18:04:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:19,843 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-15 18:04:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-15 18:04:19,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:19,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:19,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:19,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:19,844 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-15 18:04:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-15 18:04:19,846 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-15 18:04:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:19,846 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-15 18:04:19,846 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-15 18:04:19,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 114 transitions. [2022-04-15 18:04:19,929 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-15 18:04:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-15 18:04:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:04:19,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:19,930 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-15 18:04:19,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:04:19,931 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-15 18:04:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492551097] [2022-04-15 18:04:19,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 2 times [2022-04-15 18:04:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258957623] [2022-04-15 18:04:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:19,973 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-15 18:04:19,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-15 18:04:19,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-15 18:04:19,974 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-15 18:04:19,974 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-15 18:04:19,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-15 18:04:19,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-15 18:04:19,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret14 := main(); {941#true} is VALID [2022-04-15 18:04:19,974 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-15 18:04:19,975 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-15 18:04:19,975 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-15 18:04:19,975 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-15 18:04:19,975 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-15 18:04:19,976 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-15 18:04:19,976 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-15 18:04:19,976 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-15 18:04:19,977 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-15 18:04:19,977 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-15 18:04:19,977 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-15 18:04:19,978 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-15 18:04:19,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {942#false} is VALID [2022-04-15 18:04:19,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume 0 != ~p2~0; {942#false} is VALID [2022-04-15 18:04:19,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#false} assume 1 != ~lk2~0; {942#false} is VALID [2022-04-15 18:04:19,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-15 18:04:19,979 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-15 18:04:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:19,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258957623] [2022-04-15 18:04:19,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258957623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:19,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:19,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:19,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:19,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492551097] [2022-04-15 18:04:19,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492551097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:19,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:19,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:19,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259411940] [2022-04-15 18:04:19,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:19,980 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-15 18:04:19,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:19,981 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-15 18:04:19,992 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-15 18:04:19,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:19,993 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-15 18:04:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,128 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-15 18:04:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:20,128 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-15 18:04:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:20,128 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-15 18:04:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 18:04:20,130 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-15 18:04:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 18:04:20,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-15 18:04:20,251 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-15 18:04:20,253 INFO L225 Difference]: With dead ends: 100 [2022-04-15 18:04:20,253 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 18:04:20,253 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-15 18:04:20,254 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-15 18:04:20,255 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-15 18:04:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 18:04:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-15 18:04:20,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:20,261 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-15 18:04:20,262 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-15 18:04:20,262 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-15 18:04:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,264 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-15 18:04:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-15 18:04:20,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:20,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:20,264 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-15 18:04:20,265 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-15 18:04:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,267 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-15 18:04:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-15 18:04:20,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:20,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:20,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:20,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:20,267 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-15 18:04:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-15 18:04:20,269 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-15 18:04:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:20,270 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-15 18:04:20,270 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-15 18:04:20,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 116 transitions. [2022-04-15 18:04:20,361 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-15 18:04:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-15 18:04:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:04:20,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:20,362 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-15 18:04:20,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:04:20,362 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-15 18:04:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743336067] [2022-04-15 18:04:20,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 2 times [2022-04-15 18:04:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383767850] [2022-04-15 18:04:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:20,401 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-15 18:04:20,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-15 18:04:20,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-15 18:04:20,402 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-15 18:04:20,402 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-15 18:04:20,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-15 18:04:20,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-15 18:04:20,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret14 := main(); {1429#true} is VALID [2022-04-15 18:04:20,403 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-15 18:04:20,403 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-15 18:04:20,403 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-15 18:04:20,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {1429#true} assume !(0 != ~p1~0); {1429#true} is VALID [2022-04-15 18:04:20,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#true} assume !(0 != ~p2~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-15 18:04:20,404 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-15 18:04:20,405 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-15 18:04:20,405 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-15 18:04:20,405 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-15 18:04:20,406 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-15 18:04:20,406 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-15 18:04:20,406 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-15 18:04:20,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-15 18:04:20,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p2~0; {1430#false} is VALID [2022-04-15 18:04:20,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#false} assume 1 != ~lk2~0; {1430#false} is VALID [2022-04-15 18:04:20,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2022-04-15 18:04:20,408 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-15 18:04:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:20,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383767850] [2022-04-15 18:04:20,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383767850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:20,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:20,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:20,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:20,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743336067] [2022-04-15 18:04:20,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743336067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:20,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:20,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105588601] [2022-04-15 18:04:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:20,410 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-15 18:04:20,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:20,410 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-15 18:04:20,422 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-15 18:04:20,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:20,423 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-15 18:04:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,555 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-15 18:04:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:20,556 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-15 18:04:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:20,556 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-15 18:04:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 18:04:20,558 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-15 18:04:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 18:04:20,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 18:04:20,689 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-15 18:04:20,691 INFO L225 Difference]: With dead ends: 184 [2022-04-15 18:04:20,691 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 18:04:20,692 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-15 18:04:20,692 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-15 18:04:20,693 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-15 18:04:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 18:04:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-15 18:04:20,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:20,716 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-15 18:04:20,716 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-15 18:04:20,716 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-15 18:04:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,719 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-15 18:04:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-15 18:04:20,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:20,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:20,720 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-15 18:04:20,720 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-15 18:04:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:20,723 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-15 18:04:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-15 18:04:20,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:20,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:20,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:20,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:20,724 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-15 18:04:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-15 18:04:20,727 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-15 18:04:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:20,727 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-15 18:04:20,727 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-15 18:04:20,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 213 transitions. [2022-04-15 18:04:20,893 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-15 18:04:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-15 18:04:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:04:20,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:20,894 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-15 18:04:20,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:04:20,895 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-15 18:04:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:20,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229362213] [2022-04-15 18:04:20,895 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 2 times [2022-04-15 18:04:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:20,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141122744] [2022-04-15 18:04:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:20,930 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-15 18:04:20,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-15 18:04:20,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-15 18:04:20,931 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-15 18:04:20,931 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-15 18:04:20,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-15 18:04:20,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-15 18:04:20,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret14 := main(); {2305#true} is VALID [2022-04-15 18:04:20,932 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-15 18:04:20,932 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-15 18:04:20,932 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-15 18:04:20,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#true} assume !(0 != ~p1~0); {2305#true} is VALID [2022-04-15 18:04:20,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#true} assume 0 != ~p2~0;~lk2~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-15 18:04:20,933 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-15 18:04:20,933 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-15 18:04:20,934 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-15 18:04:20,934 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-15 18:04:20,934 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-15 18:04:20,935 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-15 18:04:20,935 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-15 18:04:20,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {2310#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2310#(= main_~lk2~0 1)} is VALID [2022-04-15 18:04:20,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2310#(= main_~lk2~0 1)} is VALID [2022-04-15 18:04:20,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {2310#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2306#false} is VALID [2022-04-15 18:04:20,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2022-04-15 18:04:20,936 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-15 18:04:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:20,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141122744] [2022-04-15 18:04:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141122744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:20,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:20,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:20,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:20,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229362213] [2022-04-15 18:04:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229362213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:20,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:20,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438366934] [2022-04-15 18:04:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:20,938 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-15 18:04:20,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:20,938 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-15 18:04:20,949 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-15 18:04:20,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:20,950 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-15 18:04:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,089 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-15 18:04:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:21,089 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-15 18:04:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:21,089 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-15 18:04:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-15 18:04:21,090 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-15 18:04:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-15 18:04:21,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-15 18:04:21,171 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-15 18:04:21,173 INFO L225 Difference]: With dead ends: 159 [2022-04-15 18:04:21,174 INFO L226 Difference]: Without dead ends: 157 [2022-04-15 18:04:21,174 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-15 18:04:21,174 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-15 18:04:21,175 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-15 18:04:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-15 18:04:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-15 18:04:21,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:21,183 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-15 18:04:21,184 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-15 18:04:21,184 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-15 18:04:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,187 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-15 18:04:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-15 18:04:21,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:21,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:21,188 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-15 18:04:21,188 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-15 18:04:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,194 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-15 18:04:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-15 18:04:21,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:21,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:21,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:21,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:21,195 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-15 18:04:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-15 18:04:21,198 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-15 18:04:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:21,199 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-15 18:04:21,199 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-15 18:04:21,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 211 transitions. [2022-04-15 18:04:21,364 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-15 18:04:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-15 18:04:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 18:04:21,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:21,365 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-15 18:04:21,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:04:21,365 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-15 18:04:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687498340] [2022-04-15 18:04:21,366 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 2 times [2022-04-15 18:04:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:21,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878234149] [2022-04-15 18:04:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:21,397 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-15 18:04:21,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-15 18:04:21,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-15 18:04:21,398 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-15 18:04:21,398 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-15 18:04:21,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-15 18:04:21,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-15 18:04:21,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret14 := main(); {3195#true} is VALID [2022-04-15 18:04:21,398 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-15 18:04:21,399 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-15 18:04:21,399 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-15 18:04:21,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(0 != ~p1~0); {3195#true} is VALID [2022-04-15 18:04:21,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#true} assume !(0 != ~p2~0); {3195#true} is VALID [2022-04-15 18:04:21,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#true} assume 0 != ~p3~0;~lk3~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-15 18:04:21,400 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-15 18:04:21,400 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-15 18:04:21,400 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-15 18:04:21,400 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-15 18:04:21,401 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-15 18:04:21,401 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-15 18:04:21,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-15 18:04:21,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-15 18:04:21,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3200#(= main_~lk3~0 1)} is VALID [2022-04-15 18:04:21,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3196#false} is VALID [2022-04-15 18:04:21,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2022-04-15 18:04:21,403 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-15 18:04:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878234149] [2022-04-15 18:04:21,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878234149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:21,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:21,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:21,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687498340] [2022-04-15 18:04:21,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687498340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:21,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:21,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525018564] [2022-04-15 18:04:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:21,404 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-15 18:04:21,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:21,404 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-15 18:04:21,432 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-15 18:04:21,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:21,433 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-15 18:04:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,566 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-15 18:04:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:21,566 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-15 18:04:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:21,566 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-15 18:04:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 18:04:21,567 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-15 18:04:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 18:04:21,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 18:04:21,639 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-15 18:04:21,642 INFO L225 Difference]: With dead ends: 227 [2022-04-15 18:04:21,642 INFO L226 Difference]: Without dead ends: 225 [2022-04-15 18:04:21,642 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-15 18:04:21,643 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-15 18:04:21,643 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-15 18:04:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-15 18:04:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-15 18:04:21,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:21,654 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-15 18:04:21,654 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-15 18:04:21,654 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-15 18:04:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,659 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-15 18:04:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-15 18:04:21,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:21,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:21,660 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-15 18:04:21,660 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-15 18:04:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:21,665 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-15 18:04:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-15 18:04:21,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:21,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:21,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:21,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:21,666 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-15 18:04:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-15 18:04:21,682 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-15 18:04:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:21,682 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-15 18:04:21,683 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-15 18:04:21,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 285 transitions. [2022-04-15 18:04:21,886 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-15 18:04:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-15 18:04:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 18:04:21,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:21,887 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-15 18:04:21,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:04:21,887 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-15 18:04:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677348080] [2022-04-15 18:04:21,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 2 times [2022-04-15 18:04:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181968570] [2022-04-15 18:04:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:21,918 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-15 18:04:21,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-15 18:04:21,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-15 18:04:21,919 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-15 18:04:21,919 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-15 18:04:21,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-15 18:04:21,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-15 18:04:21,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {4445#true} call #t~ret14 := main(); {4445#true} is VALID [2022-04-15 18:04:21,920 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-15 18:04:21,920 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-15 18:04:21,920 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-15 18:04:21,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {4445#true} assume !(0 != ~p1~0); {4445#true} is VALID [2022-04-15 18:04:21,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {4445#true} assume !(0 != ~p2~0); {4445#true} is VALID [2022-04-15 18:04:21,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#true} assume !(0 != ~p3~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-15 18:04:21,921 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-15 18:04:21,921 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-15 18:04:21,921 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-15 18:04:21,922 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-15 18:04:21,922 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-15 18:04:21,922 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-15 18:04:21,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-15 18:04:21,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-15 18:04:21,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p3~0; {4446#false} is VALID [2022-04-15 18:04:21,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#false} assume 1 != ~lk3~0; {4446#false} is VALID [2022-04-15 18:04:21,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#false} assume !false; {4446#false} is VALID [2022-04-15 18:04:21,924 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-15 18:04:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181968570] [2022-04-15 18:04:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181968570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:21,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:21,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:21,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677348080] [2022-04-15 18:04:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677348080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:21,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:21,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128713475] [2022-04-15 18:04:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:21,925 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-15 18:04:21,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:21,925 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-15 18:04:21,936 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-15 18:04:21,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:21,937 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-15 18:04:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,064 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-15 18:04:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:22,064 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-15 18:04:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:22,065 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-15 18:04:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 18:04:22,066 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-15 18:04:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 18:04:22,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-15 18:04:22,158 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-15 18:04:22,161 INFO L225 Difference]: With dead ends: 391 [2022-04-15 18:04:22,161 INFO L226 Difference]: Without dead ends: 233 [2022-04-15 18:04:22,162 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-15 18:04:22,162 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-15 18:04:22,163 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-15 18:04:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-15 18:04:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-15 18:04:22,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:22,175 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-15 18:04:22,176 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-15 18:04:22,176 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-15 18:04:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,181 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-15 18:04:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-15 18:04:22,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:22,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:22,182 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-15 18:04:22,182 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-15 18:04:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,187 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-15 18:04:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-15 18:04:22,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:22,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:22,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:22,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:22,188 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-15 18:04:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-15 18:04:22,192 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-15 18:04:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:22,193 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-15 18:04:22,193 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-15 18:04:22,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 391 transitions. [2022-04-15 18:04:22,504 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-15 18:04:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-15 18:04:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 18:04:22,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:22,504 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-15 18:04:22,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:04:22,505 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-15 18:04:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:22,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1801723518] [2022-04-15 18:04:22,506 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 2 times [2022-04-15 18:04:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909382597] [2022-04-15 18:04:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:22,535 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-15 18:04:22,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-15 18:04:22,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-15 18:04:22,535 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-15 18:04:22,536 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-15 18:04:22,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-15 18:04:22,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-15 18:04:22,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret14 := main(); {6167#true} is VALID [2022-04-15 18:04:22,536 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-15 18:04:22,536 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-15 18:04:22,536 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-15 18:04:22,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#true} assume !(0 != ~p1~0); {6167#true} is VALID [2022-04-15 18:04:22,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6167#true} assume !(0 != ~p2~0); {6167#true} is VALID [2022-04-15 18:04:22,537 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-15 18:04:22,537 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-15 18:04:22,537 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-15 18:04:22,538 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-15 18:04:22,538 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-15 18:04:22,538 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-15 18:04:22,539 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-15 18:04:22,539 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-15 18:04:22,539 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-15 18:04:22,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6168#false} is VALID [2022-04-15 18:04:22,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#false} assume 0 != ~p4~0; {6168#false} is VALID [2022-04-15 18:04:22,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume 1 != ~lk4~0; {6168#false} is VALID [2022-04-15 18:04:22,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-15 18:04:22,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-15 18:04:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:22,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909382597] [2022-04-15 18:04:22,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909382597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:22,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:22,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:22,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1801723518] [2022-04-15 18:04:22,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1801723518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:22,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:22,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922221676] [2022-04-15 18:04:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:22,541 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-15 18:04:22,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:22,541 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-15 18:04:22,553 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-15 18:04:22,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:22,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:22,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:22,554 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-15 18:04:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,715 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-15 18:04:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:22,715 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-15 18:04:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:22,716 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-15 18:04:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 18:04:22,717 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-15 18:04:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 18:04:22,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 18:04:22,828 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-15 18:04:22,832 INFO L225 Difference]: With dead ends: 349 [2022-04-15 18:04:22,832 INFO L226 Difference]: Without dead ends: 239 [2022-04-15 18:04:22,833 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-15 18:04:22,833 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-15 18:04:22,833 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-15 18:04:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-15 18:04:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-15 18:04:22,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:22,848 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-15 18:04:22,848 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-15 18:04:22,849 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-15 18:04:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,852 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-15 18:04:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-15 18:04:22,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:22,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:22,853 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-15 18:04:22,855 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-15 18:04:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:22,858 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-15 18:04:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-15 18:04:22,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:22,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:22,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:22,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:22,859 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-15 18:04:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-15 18:04:22,864 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-15 18:04:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:22,864 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-15 18:04:22,864 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-15 18:04:22,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 395 transitions. [2022-04-15 18:04:23,209 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-15 18:04:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-15 18:04:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 18:04:23,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:23,210 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-15 18:04:23,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:04:23,211 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-15 18:04:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:23,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [508977609] [2022-04-15 18:04:23,211 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 2 times [2022-04-15 18:04:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249556512] [2022-04-15 18:04:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:23,259 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-15 18:04:23,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-15 18:04:23,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-15 18:04:23,260 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-15 18:04:23,260 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-15 18:04:23,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-15 18:04:23,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-15 18:04:23,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {7829#true} call #t~ret14 := main(); {7829#true} is VALID [2022-04-15 18:04:23,260 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-15 18:04:23,260 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-15 18:04:23,260 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-15 18:04:23,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {7829#true} assume !(0 != ~p1~0); {7829#true} is VALID [2022-04-15 18:04:23,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {7829#true} assume !(0 != ~p2~0); {7829#true} is VALID [2022-04-15 18:04:23,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {7829#true} assume !(0 != ~p3~0); {7829#true} is VALID [2022-04-15 18:04:23,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {7829#true} assume 0 != ~p4~0;~lk4~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-15 18:04:23,264 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-15 18:04:23,264 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-15 18:04:23,264 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-15 18:04:23,265 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-15 18:04:23,265 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-15 18:04:23,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-15 18:04:23,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-15 18:04:23,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-15 18:04:23,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7834#(= main_~lk4~0 1)} is VALID [2022-04-15 18:04:23,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {7834#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7830#false} is VALID [2022-04-15 18:04:23,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {7830#false} assume !false; {7830#false} is VALID [2022-04-15 18:04:23,267 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-15 18:04:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249556512] [2022-04-15 18:04:23,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249556512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:23,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:23,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:23,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [508977609] [2022-04-15 18:04:23,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [508977609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:23,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:23,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533281171] [2022-04-15 18:04:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:23,268 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-15 18:04:23,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:23,268 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-15 18:04:23,283 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-15 18:04:23,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:23,284 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-15 18:04:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:23,415 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-15 18:04:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:23,415 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-15 18:04:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:23,416 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-15 18:04:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 18:04:23,417 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-15 18:04:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 18:04:23,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-15 18:04:23,480 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-15 18:04:23,489 INFO L225 Difference]: With dead ends: 429 [2022-04-15 18:04:23,489 INFO L226 Difference]: Without dead ends: 427 [2022-04-15 18:04:23,489 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-15 18:04:23,491 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-15 18:04:23,491 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-15 18:04:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-15 18:04:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-15 18:04:23,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:23,508 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-15 18:04:23,509 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-15 18:04:23,509 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-15 18:04:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:23,518 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-15 18:04:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-15 18:04:23,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:23,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:23,520 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-15 18:04:23,520 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-15 18:04:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:23,528 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-15 18:04:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-15 18:04:23,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:23,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:23,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:23,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:23,530 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-15 18:04:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-15 18:04:23,536 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-15 18:04:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:23,536 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-15 18:04:23,536 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-15 18:04:23,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 539 transitions. [2022-04-15 18:04:24,004 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-15 18:04:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-15 18:04:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 18:04:24,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:24,005 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-15 18:04:24,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:04:24,005 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-15 18:04:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:24,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231011060] [2022-04-15 18:04:24,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 2 times [2022-04-15 18:04:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:24,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274110583] [2022-04-15 18:04:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:24,037 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-15 18:04:24,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 18:04:24,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-15 18:04:24,038 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-15 18:04:24,038 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-15 18:04:24,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 18:04:24,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-15 18:04:24,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret14 := main(); {10211#true} is VALID [2022-04-15 18:04:24,038 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-15 18:04:24,038 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-15 18:04:24,038 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-15 18:04:24,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} assume !(0 != ~p1~0); {10211#true} is VALID [2022-04-15 18:04:24,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 != ~p2~0); {10211#true} is VALID [2022-04-15 18:04:24,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume !(0 != ~p3~0); {10211#true} is VALID [2022-04-15 18:04:24,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {10211#true} assume !(0 != ~p4~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-15 18:04:24,039 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-15 18:04:24,039 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-15 18:04:24,040 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-15 18:04:24,040 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-15 18:04:24,040 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-15 18:04:24,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-15 18:04:24,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-15 18:04:24,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-15 18:04:24,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p4~0; {10212#false} is VALID [2022-04-15 18:04:24,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {10212#false} assume 1 != ~lk4~0; {10212#false} is VALID [2022-04-15 18:04:24,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-15 18:04:24,042 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-15 18:04:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274110583] [2022-04-15 18:04:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274110583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:24,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:24,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:24,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231011060] [2022-04-15 18:04:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231011060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:24,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:24,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142347338] [2022-04-15 18:04:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:24,043 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-15 18:04:24,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:24,043 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-15 18:04:24,055 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-15 18:04:24,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:24,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:24,055 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-15 18:04:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:24,207 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-15 18:04:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:24,207 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-15 18:04:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:24,208 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-15 18:04:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 18:04:24,209 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-15 18:04:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-15 18:04:24,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-15 18:04:24,297 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-15 18:04:24,306 INFO L225 Difference]: With dead ends: 765 [2022-04-15 18:04:24,306 INFO L226 Difference]: Without dead ends: 451 [2022-04-15 18:04:24,307 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-15 18:04:24,307 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-15 18:04:24,308 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-15 18:04:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-15 18:04:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-15 18:04:24,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:24,330 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-15 18:04:24,331 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-15 18:04:24,332 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-15 18:04:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:24,340 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-15 18:04:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-15 18:04:24,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:24,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:24,342 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-15 18:04:24,342 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-15 18:04:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:24,351 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-15 18:04:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-15 18:04:24,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:24,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:24,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:24,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:24,352 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-15 18:04:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-15 18:04:24,362 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-15 18:04:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:24,362 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-15 18:04:24,363 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-15 18:04:24,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 449 states and 727 transitions. [2022-04-15 18:04:24,918 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-15 18:04:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-15 18:04:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 18:04:24,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:24,919 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-15 18:04:24,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:04:24,919 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-15 18:04:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:24,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36291760] [2022-04-15 18:04:24,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 2 times [2022-04-15 18:04:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:24,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263526273] [2022-04-15 18:04:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:24,950 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-15 18:04:24,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-15 18:04:24,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-15 18:04:24,951 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-15 18:04:24,951 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-15 18:04:24,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-15 18:04:24,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-15 18:04:24,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {13553#true} call #t~ret14 := main(); {13553#true} is VALID [2022-04-15 18:04:24,951 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-15 18:04:24,951 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-15 18:04:24,951 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-15 18:04:24,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume !(0 != ~p1~0); {13553#true} is VALID [2022-04-15 18:04:24,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume !(0 != ~p2~0); {13553#true} is VALID [2022-04-15 18:04:24,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#true} assume !(0 != ~p3~0); {13553#true} is VALID [2022-04-15 18:04:24,952 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-15 18:04:24,952 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-15 18:04:24,952 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-15 18:04:24,953 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-15 18:04:24,953 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-15 18:04:24,953 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-15 18:04:24,954 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-15 18:04:24,954 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-15 18:04:24,954 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-15 18:04:24,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13554#false} is VALID [2022-04-15 18:04:24,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {13554#false} assume 0 != ~p5~0; {13554#false} is VALID [2022-04-15 18:04:24,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {13554#false} assume 1 != ~lk5~0; {13554#false} is VALID [2022-04-15 18:04:24,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-04-15 18:04:24,955 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-15 18:04:24,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:24,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263526273] [2022-04-15 18:04:24,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263526273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:24,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:24,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36291760] [2022-04-15 18:04:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36291760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:24,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:24,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552691204] [2022-04-15 18:04:24,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:24,956 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-15 18:04:24,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:24,957 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-15 18:04:24,970 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-15 18:04:24,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:24,971 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-15 18:04:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:25,129 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-15 18:04:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:25,130 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-15 18:04:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:25,130 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-15 18:04:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 18:04:25,132 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-15 18:04:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-15 18:04:25,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-15 18:04:25,232 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-15 18:04:25,242 INFO L225 Difference]: With dead ends: 673 [2022-04-15 18:04:25,242 INFO L226 Difference]: Without dead ends: 459 [2022-04-15 18:04:25,242 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-15 18:04:25,243 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-15 18:04:25,243 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-15 18:04:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-15 18:04:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-15 18:04:25,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:25,267 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-15 18:04:25,267 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-15 18:04:25,268 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-15 18:04:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:25,279 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-15 18:04:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-15 18:04:25,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:25,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:25,300 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-15 18:04:25,300 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-15 18:04:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:25,309 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-15 18:04:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-15 18:04:25,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:25,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:25,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:25,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:25,310 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-15 18:04:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-15 18:04:25,321 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-15 18:04:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:25,321 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-15 18:04:25,321 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-15 18:04:25,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 727 transitions. [2022-04-15 18:04:25,932 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-15 18:04:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-15 18:04:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 18:04:25,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:25,933 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-15 18:04:25,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:04:25,934 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-15 18:04:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:25,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521034508] [2022-04-15 18:04:25,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 2 times [2022-04-15 18:04:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:25,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155377320] [2022-04-15 18:04:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:25,965 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-15 18:04:25,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-15 18:04:25,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-15 18:04:25,966 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-15 18:04:25,966 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-15 18:04:25,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-15 18:04:25,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-15 18:04:25,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {16743#true} call #t~ret14 := main(); {16743#true} is VALID [2022-04-15 18:04:25,966 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-15 18:04:25,966 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-15 18:04:25,966 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-15 18:04:25,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {16743#true} assume !(0 != ~p1~0); {16743#true} is VALID [2022-04-15 18:04:25,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {16743#true} assume !(0 != ~p2~0); {16743#true} is VALID [2022-04-15 18:04:25,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {16743#true} assume !(0 != ~p3~0); {16743#true} is VALID [2022-04-15 18:04:25,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {16743#true} assume !(0 != ~p4~0); {16743#true} is VALID [2022-04-15 18:04:25,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#true} assume 0 != ~p5~0;~lk5~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,967 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-15 18:04:25,967 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-15 18:04:25,968 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-15 18:04:25,968 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-15 18:04:25,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16748#(= main_~lk5~0 1)} is VALID [2022-04-15 18:04:25,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16744#false} is VALID [2022-04-15 18:04:25,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {16744#false} assume !false; {16744#false} is VALID [2022-04-15 18:04:25,970 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-15 18:04:25,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:25,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155377320] [2022-04-15 18:04:25,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155377320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:25,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:25,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:25,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:25,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521034508] [2022-04-15 18:04:25,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521034508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:25,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:25,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:25,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483102265] [2022-04-15 18:04:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:25,971 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-15 18:04:25,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:25,972 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-15 18:04:25,988 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-15 18:04:25,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:25,988 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-15 18:04:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:26,183 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-15 18:04:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:26,183 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-15 18:04:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:26,184 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-15 18:04:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:04:26,185 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-15 18:04:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:04:26,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 18:04:26,256 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-15 18:04:26,282 INFO L225 Difference]: With dead ends: 813 [2022-04-15 18:04:26,283 INFO L226 Difference]: Without dead ends: 811 [2022-04-15 18:04:26,284 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-15 18:04:26,284 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-15 18:04:26,285 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-15 18:04:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-15 18:04:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-15 18:04:26,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:26,319 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-15 18:04:26,320 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-15 18:04:26,320 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-15 18:04:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:26,343 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-15 18:04:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-15 18:04:26,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:26,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:26,346 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-15 18:04:26,347 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-15 18:04:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:26,370 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-15 18:04:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-15 18:04:26,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:26,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:26,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:26,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:26,372 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-15 18:04:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-15 18:04:26,391 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-15 18:04:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:26,391 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-15 18:04:26,391 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-15 18:04:26,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1007 transitions. [2022-04-15 18:04:27,300 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-15 18:04:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-15 18:04:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 18:04:27,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:27,303 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-15 18:04:27,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:04:27,303 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-15 18:04:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:27,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7344591] [2022-04-15 18:04:27,304 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 2 times [2022-04-15 18:04:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:27,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670344517] [2022-04-15 18:04:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:27,353 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-15 18:04:27,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-15 18:04:27,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-15 18:04:27,354 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-15 18:04:27,355 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-15 18:04:27,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-15 18:04:27,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-15 18:04:27,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {21301#true} call #t~ret14 := main(); {21301#true} is VALID [2022-04-15 18:04:27,357 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-15 18:04:27,357 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-15 18:04:27,357 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-15 18:04:27,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {21301#true} assume !(0 != ~p1~0); {21301#true} is VALID [2022-04-15 18:04:27,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {21301#true} assume !(0 != ~p2~0); {21301#true} is VALID [2022-04-15 18:04:27,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {21301#true} assume !(0 != ~p3~0); {21301#true} is VALID [2022-04-15 18:04:27,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {21301#true} assume !(0 != ~p4~0); {21301#true} is VALID [2022-04-15 18:04:27,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {21301#true} assume !(0 != ~p5~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-15 18:04:27,358 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-15 18:04:27,358 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-15 18:04:27,359 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-15 18:04:27,360 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-15 18:04:27,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p1~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-15 18:04:27,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p2~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-15 18:04:27,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p3~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-15 18:04:27,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p4~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-15 18:04:27,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p5~0; {21302#false} is VALID [2022-04-15 18:04:27,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {21302#false} assume 1 != ~lk5~0; {21302#false} is VALID [2022-04-15 18:04:27,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {21302#false} assume !false; {21302#false} is VALID [2022-04-15 18:04:27,361 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-15 18:04:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:27,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670344517] [2022-04-15 18:04:27,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670344517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:27,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:27,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:27,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:27,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7344591] [2022-04-15 18:04:27,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7344591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:27,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:27,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911475198] [2022-04-15 18:04:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:27,363 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-15 18:04:27,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:27,363 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-15 18:04:27,377 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-15 18:04:27,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:27,377 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-15 18:04:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:27,650 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-15 18:04:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:27,651 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-15 18:04:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:27,651 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-15 18:04:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-15 18:04:27,652 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-15 18:04:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-15 18:04:27,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-15 18:04:27,776 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-15 18:04:27,807 INFO L225 Difference]: With dead ends: 1501 [2022-04-15 18:04:27,807 INFO L226 Difference]: Without dead ends: 875 [2022-04-15 18:04:27,808 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-15 18:04:27,809 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-15 18:04:27,810 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-15 18:04:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-15 18:04:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-15 18:04:27,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:27,877 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-15 18:04:27,878 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-15 18:04:27,879 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-15 18:04:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:27,904 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-15 18:04:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-15 18:04:27,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:27,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:27,906 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-15 18:04:27,907 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-15 18:04:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:27,931 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-15 18:04:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-15 18:04:27,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:27,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:27,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:27,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:27,933 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-15 18:04:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-15 18:04:27,966 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-15 18:04:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:27,966 INFO L478 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-15 18:04:27,966 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-15 18:04:27,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 873 states and 1335 transitions. [2022-04-15 18:04:29,077 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-15 18:04:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-15 18:04:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 18:04:29,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:29,079 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-15 18:04:29,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:04:29,079 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-15 18:04:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:29,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736458344] [2022-04-15 18:04:29,080 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 2 times [2022-04-15 18:04:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:29,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142084451] [2022-04-15 18:04:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:29,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:29,127 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-15 18:04:29,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-15 18:04:29,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-15 18:04:29,128 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-15 18:04:29,128 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-15 18:04:29,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-15 18:04:29,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-15 18:04:29,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {27811#true} call #t~ret14 := main(); {27811#true} is VALID [2022-04-15 18:04:29,129 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-15 18:04:29,129 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-15 18:04:29,133 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-15 18:04:29,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {27811#true} assume !(0 != ~p1~0); {27811#true} is VALID [2022-04-15 18:04:29,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {27811#true} assume !(0 != ~p2~0); {27811#true} is VALID [2022-04-15 18:04:29,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {27811#true} assume !(0 != ~p3~0); {27811#true} is VALID [2022-04-15 18:04:29,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {27811#true} assume !(0 != ~p4~0); {27811#true} is VALID [2022-04-15 18:04:29,133 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-15 18:04:29,134 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-15 18:04:29,134 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-15 18:04:29,134 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-15 18:04:29,135 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-15 18:04:29,135 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-15 18:04:29,135 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-15 18:04:29,136 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-15 18:04:29,136 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-15 18:04:29,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {27812#false} is VALID [2022-04-15 18:04:29,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {27812#false} assume 0 != ~p6~0; {27812#false} is VALID [2022-04-15 18:04:29,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {27812#false} assume 1 != ~lk6~0; {27812#false} is VALID [2022-04-15 18:04:29,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {27812#false} assume !false; {27812#false} is VALID [2022-04-15 18:04:29,137 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-15 18:04:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:29,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142084451] [2022-04-15 18:04:29,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142084451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:29,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:29,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:29,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736458344] [2022-04-15 18:04:29,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736458344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:29,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:29,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231187648] [2022-04-15 18:04:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:29,141 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-15 18:04:29,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:29,141 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-15 18:04:29,155 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-15 18:04:29,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:29,156 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-15 18:04:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:29,380 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-15 18:04:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:29,380 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-15 18:04:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:29,381 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-15 18:04:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-15 18:04:29,382 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-15 18:04:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-15 18:04:29,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-15 18:04:29,499 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-15 18:04:29,532 INFO L225 Difference]: With dead ends: 1309 [2022-04-15 18:04:29,532 INFO L226 Difference]: Without dead ends: 891 [2022-04-15 18:04:29,533 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-15 18:04:29,534 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-15 18:04:29,534 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-15 18:04:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-15 18:04:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-15 18:04:29,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:29,606 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-15 18:04:29,607 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-15 18:04:29,607 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-15 18:04:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:29,633 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-15 18:04:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-15 18:04:29,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:29,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:29,635 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-15 18:04:29,636 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-15 18:04:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:29,662 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-15 18:04:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-15 18:04:29,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:29,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:29,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:29,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:29,664 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-15 18:04:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-15 18:04:29,699 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-15 18:04:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:29,700 INFO L478 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-15 18:04:29,700 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-15 18:04:29,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 889 states and 1335 transitions. [2022-04-15 18:04:30,908 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-15 18:04:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-15 18:04:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 18:04:30,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:30,909 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-15 18:04:30,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:04:30,910 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-15 18:04:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:30,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575547927] [2022-04-15 18:04:30,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 2 times [2022-04-15 18:04:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949872656] [2022-04-15 18:04:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:30,966 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-15 18:04:30,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-15 18:04:30,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-15 18:04:30,966 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-15 18:04:30,967 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-15 18:04:30,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-15 18:04:30,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-15 18:04:30,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {34001#true} call #t~ret14 := main(); {34001#true} is VALID [2022-04-15 18:04:30,967 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-15 18:04:30,967 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-15 18:04:30,967 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-15 18:04:30,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 != ~p1~0); {34001#true} is VALID [2022-04-15 18:04:30,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume !(0 != ~p2~0); {34001#true} is VALID [2022-04-15 18:04:30,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {34001#true} assume !(0 != ~p3~0); {34001#true} is VALID [2022-04-15 18:04:30,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {34001#true} assume !(0 != ~p4~0); {34001#true} is VALID [2022-04-15 18:04:30,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {34001#true} assume !(0 != ~p5~0); {34001#true} is VALID [2022-04-15 18:04:30,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {34001#true} assume 0 != ~p6~0;~lk6~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,968 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-15 18:04:30,969 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-15 18:04:30,971 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-15 18:04:30,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p6~0; {34006#(= main_~lk6~0 1)} is VALID [2022-04-15 18:04:30,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {34006#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {34002#false} is VALID [2022-04-15 18:04:30,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-15 18:04:30,979 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-15 18:04:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:30,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949872656] [2022-04-15 18:04:30,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949872656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:30,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:30,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:30,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575547927] [2022-04-15 18:04:30,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575547927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:30,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:30,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893418527] [2022-04-15 18:04:30,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:30,981 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-15 18:04:30,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:30,981 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-15 18:04:30,994 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-15 18:04:30,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:30,995 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-15 18:04:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:31,285 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-15 18:04:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:31,286 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-15 18:04:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:31,286 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-15 18:04:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 18:04:31,287 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-15 18:04:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 18:04:31,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 18:04:31,346 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-15 18:04:31,460 INFO L225 Difference]: With dead ends: 1549 [2022-04-15 18:04:31,461 INFO L226 Difference]: Without dead ends: 1547 [2022-04-15 18:04:31,461 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-15 18:04:31,461 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-15 18:04:31,461 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-15 18:04:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-15 18:04:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-15 18:04:31,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:31,535 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-15 18:04:31,536 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-15 18:04:31,537 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-15 18:04:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:31,607 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-15 18:04:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-15 18:04:31,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:31,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:31,610 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-15 18:04:31,611 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-15 18:04:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:31,681 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-15 18:04:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-15 18:04:31,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:31,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:31,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:31,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:31,684 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-15 18:04:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-15 18:04:31,749 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-15 18:04:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:31,749 INFO L478 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-15 18:04:31,749 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-15 18:04:31,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1289 states and 1879 transitions. [2022-04-15 18:04:33,296 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-15 18:04:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-15 18:04:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 18:04:33,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:33,297 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-15 18:04:33,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:04:33,297 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-15 18:04:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779637835] [2022-04-15 18:04:33,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 2 times [2022-04-15 18:04:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176448695] [2022-04-15 18:04:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:33,339 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-15 18:04:33,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-15 18:04:33,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-15 18:04:33,341 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-15 18:04:33,341 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-15 18:04:33,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-15 18:04:33,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-15 18:04:33,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {42783#true} call #t~ret14 := main(); {42783#true} is VALID [2022-04-15 18:04:33,341 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-15 18:04:33,342 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-15 18:04:33,342 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-15 18:04:33,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {42783#true} assume !(0 != ~p1~0); {42783#true} is VALID [2022-04-15 18:04:33,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {42783#true} assume !(0 != ~p2~0); {42783#true} is VALID [2022-04-15 18:04:33,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {42783#true} assume !(0 != ~p3~0); {42783#true} is VALID [2022-04-15 18:04:33,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {42783#true} assume !(0 != ~p4~0); {42783#true} is VALID [2022-04-15 18:04:33,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {42783#true} assume !(0 != ~p5~0); {42783#true} is VALID [2022-04-15 18:04:33,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {42783#true} assume !(0 != ~p6~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,343 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-15 18:04:33,343 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-15 18:04:33,343 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-15 18:04:33,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p1~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p2~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p3~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p4~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p5~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-15 18:04:33,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p6~0; {42784#false} is VALID [2022-04-15 18:04:33,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {42784#false} assume 1 != ~lk6~0; {42784#false} is VALID [2022-04-15 18:04:33,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {42784#false} assume !false; {42784#false} is VALID [2022-04-15 18:04:33,345 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-15 18:04:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:33,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176448695] [2022-04-15 18:04:33,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176448695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:33,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:33,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:33,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:33,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779637835] [2022-04-15 18:04:33,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779637835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:33,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:33,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739589559] [2022-04-15 18:04:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:33,348 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-15 18:04:33,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:33,348 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-15 18:04:33,361 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-15 18:04:33,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:33,361 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-15 18:04:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:33,939 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-15 18:04:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:33,945 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-15 18:04:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:33,945 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-15 18:04:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:04:33,946 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-15 18:04:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 18:04:33,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 18:04:34,015 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-15 18:04:34,147 INFO L225 Difference]: With dead ends: 2957 [2022-04-15 18:04:34,148 INFO L226 Difference]: Without dead ends: 1707 [2022-04-15 18:04:34,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-15 18:04:34,150 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-15 18:04:34,150 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-15 18:04:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-15 18:04:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-15 18:04:34,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:34,250 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-15 18:04:34,251 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-15 18:04:34,252 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-15 18:04:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:34,333 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-15 18:04:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-15 18:04:34,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:34,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:34,337 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-15 18:04:34,338 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-15 18:04:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:34,419 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-15 18:04:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-15 18:04:34,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:34,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:34,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:34,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:34,423 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-15 18:04:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-15 18:04:34,570 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-15 18:04:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:34,570 INFO L478 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-15 18:04:34,570 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-15 18:04:34,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1705 states and 2439 transitions. [2022-04-15 18:04:36,637 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-15 18:04:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-15 18:04:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:04:36,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:36,639 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-15 18:04:36,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:04:36,639 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-15 18:04:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:36,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818655866] [2022-04-15 18:04:36,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 2 times [2022-04-15 18:04:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:36,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471774693] [2022-04-15 18:04:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:36,689 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-15 18:04:36,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-15 18:04:36,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-15 18:04:36,690 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-15 18:04:36,690 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-15 18:04:36,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-15 18:04:36,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-15 18:04:36,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {55533#true} call #t~ret14 := main(); {55533#true} is VALID [2022-04-15 18:04:36,690 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-15 18:04:36,690 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-15 18:04:36,690 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-15 18:04:36,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {55533#true} assume !(0 != ~p1~0); {55533#true} is VALID [2022-04-15 18:04:36,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {55533#true} assume !(0 != ~p2~0); {55533#true} is VALID [2022-04-15 18:04:36,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {55533#true} assume !(0 != ~p3~0); {55533#true} is VALID [2022-04-15 18:04:36,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {55533#true} assume !(0 != ~p4~0); {55533#true} is VALID [2022-04-15 18:04:36,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {55533#true} assume !(0 != ~p5~0); {55533#true} is VALID [2022-04-15 18:04:36,691 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-15 18:04:36,691 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-15 18:04:36,692 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-15 18:04:36,692 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-15 18:04:36,692 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-15 18:04:36,692 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-15 18:04:36,693 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-15 18:04:36,693 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-15 18:04:36,693 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-15 18:04:36,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {55534#false} is VALID [2022-04-15 18:04:36,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {55534#false} assume 0 != ~p7~0; {55534#false} is VALID [2022-04-15 18:04:36,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {55534#false} assume 1 != ~lk7~0; {55534#false} is VALID [2022-04-15 18:04:36,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {55534#false} assume !false; {55534#false} is VALID [2022-04-15 18:04:36,694 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-15 18:04:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471774693] [2022-04-15 18:04:36,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471774693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:36,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:36,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:36,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818655866] [2022-04-15 18:04:36,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818655866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:36,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:36,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314848281] [2022-04-15 18:04:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:36,695 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-15 18:04:36,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:36,695 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-15 18:04:36,708 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-15 18:04:36,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:36,708 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-15 18:04:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:37,179 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-15 18:04:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:37,180 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-15 18:04:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:37,180 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-15 18:04:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-15 18:04:37,181 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-15 18:04:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-15 18:04:37,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-15 18:04:37,243 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-15 18:04:37,365 INFO L225 Difference]: With dead ends: 2557 [2022-04-15 18:04:37,366 INFO L226 Difference]: Without dead ends: 1739 [2022-04-15 18:04:37,367 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-15 18:04:37,367 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-15 18:04:37,368 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-15 18:04:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-15 18:04:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-15 18:04:37,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:37,473 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-15 18:04:37,474 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-15 18:04:37,475 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-15 18:04:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:37,559 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-15 18:04:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-15 18:04:37,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:37,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:37,562 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-15 18:04:37,564 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-15 18:04:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:37,650 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-15 18:04:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-15 18:04:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:37,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:37,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:37,654 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-15 18:04:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-15 18:04:37,800 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-15 18:04:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:37,800 INFO L478 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-15 18:04:37,800 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-15 18:04:37,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1737 states and 2439 transitions. [2022-04-15 18:04:40,065 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-15 18:04:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-15 18:04:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:04:40,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:40,067 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-15 18:04:40,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:04:40,067 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-15 18:04:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749619057] [2022-04-15 18:04:40,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 2 times [2022-04-15 18:04:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145354795] [2022-04-15 18:04:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:40,129 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-15 18:04:40,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-15 18:04:40,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-15 18:04:40,130 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-15 18:04:40,130 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-15 18:04:40,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-15 18:04:40,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-15 18:04:40,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {67611#true} call #t~ret14 := main(); {67611#true} is VALID [2022-04-15 18:04:40,130 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-15 18:04:40,130 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-15 18:04:40,130 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-15 18:04:40,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {67611#true} assume !(0 != ~p1~0); {67611#true} is VALID [2022-04-15 18:04:40,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {67611#true} assume !(0 != ~p2~0); {67611#true} is VALID [2022-04-15 18:04:40,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {67611#true} assume !(0 != ~p3~0); {67611#true} is VALID [2022-04-15 18:04:40,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {67611#true} assume !(0 != ~p4~0); {67611#true} is VALID [2022-04-15 18:04:40,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {67611#true} assume !(0 != ~p5~0); {67611#true} is VALID [2022-04-15 18:04:40,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {67611#true} assume !(0 != ~p6~0); {67611#true} is VALID [2022-04-15 18:04:40,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {67611#true} assume 0 != ~p7~0;~lk7~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,132 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-15 18:04:40,132 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-15 18:04:40,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p7~0; {67616#(= main_~lk7~0 1)} is VALID [2022-04-15 18:04:40,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {67616#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {67612#false} is VALID [2022-04-15 18:04:40,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {67612#false} assume !false; {67612#false} is VALID [2022-04-15 18:04:40,135 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-15 18:04:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:40,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145354795] [2022-04-15 18:04:40,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145354795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:40,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:40,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:40,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:40,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749619057] [2022-04-15 18:04:40,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749619057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:40,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:40,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913831766] [2022-04-15 18:04:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:40,139 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-15 18:04:40,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:40,139 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-15 18:04:40,157 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-15 18:04:40,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:40,158 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-15 18:04:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:40,835 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-15 18:04:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:40,835 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-15 18:04:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:40,835 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-15 18:04:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 18:04:40,836 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-15 18:04:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 18:04:40,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-15 18:04:40,903 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-15 18:04:41,235 INFO L225 Difference]: With dead ends: 2957 [2022-04-15 18:04:41,235 INFO L226 Difference]: Without dead ends: 2955 [2022-04-15 18:04:41,236 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-15 18:04:41,236 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-15 18:04:41,236 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-15 18:04:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-15 18:04:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-15 18:04:41,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:41,400 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-15 18:04:41,402 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-15 18:04:41,404 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-15 18:04:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:41,612 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-15 18:04:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-15 18:04:41,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:41,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:41,618 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-15 18:04:41,620 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-15 18:04:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:41,835 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-15 18:04:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-15 18:04:41,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:41,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:41,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:41,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:41,841 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-15 18:04:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-15 18:04:42,141 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-15 18:04:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:42,141 INFO L478 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-15 18:04:42,141 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-15 18:04:42,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2569 states and 3495 transitions. [2022-04-15 18:04:45,537 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-15 18:04:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-15 18:04:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:04:45,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:45,540 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-15 18:04:45,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:04:45,540 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-15 18:04:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:45,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209486906] [2022-04-15 18:04:45,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 2 times [2022-04-15 18:04:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:45,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627422929] [2022-04-15 18:04:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:45,563 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-15 18:04:45,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-15 18:04:45,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-15 18:04:45,564 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-15 18:04:45,564 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-15 18:04:45,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-15 18:04:45,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-15 18:04:45,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {84585#true} call #t~ret14 := main(); {84585#true} is VALID [2022-04-15 18:04:45,565 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-15 18:04:45,565 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-15 18:04:45,565 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-15 18:04:45,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {84585#true} assume !(0 != ~p1~0); {84585#true} is VALID [2022-04-15 18:04:45,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {84585#true} assume !(0 != ~p2~0); {84585#true} is VALID [2022-04-15 18:04:45,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {84585#true} assume !(0 != ~p3~0); {84585#true} is VALID [2022-04-15 18:04:45,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {84585#true} assume !(0 != ~p4~0); {84585#true} is VALID [2022-04-15 18:04:45,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {84585#true} assume !(0 != ~p5~0); {84585#true} is VALID [2022-04-15 18:04:45,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {84585#true} assume !(0 != ~p6~0); {84585#true} is VALID [2022-04-15 18:04:45,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {84585#true} assume !(0 != ~p7~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,566 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-15 18:04:45,566 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-15 18:04:45,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p1~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p2~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p3~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p4~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p5~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p6~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-15 18:04:45,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p7~0; {84586#false} is VALID [2022-04-15 18:04:45,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {84586#false} assume 1 != ~lk7~0; {84586#false} is VALID [2022-04-15 18:04:45,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {84586#false} assume !false; {84586#false} is VALID [2022-04-15 18:04:45,569 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-15 18:04:45,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:45,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627422929] [2022-04-15 18:04:45,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627422929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:45,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:45,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:45,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:45,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209486906] [2022-04-15 18:04:45,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209486906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:45,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:45,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538557306] [2022-04-15 18:04:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:45,570 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-15 18:04:45,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:45,570 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-15 18:04:45,587 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-15 18:04:45,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:45,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:45,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:45,588 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-15 18:04:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:47,319 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-15 18:04:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:47,319 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-15 18:04:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:47,319 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-15 18:04:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 18:04:47,320 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-15 18:04:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 18:04:47,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-15 18:04:47,401 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-15 18:04:47,918 INFO L225 Difference]: With dead ends: 5837 [2022-04-15 18:04:47,918 INFO L226 Difference]: Without dead ends: 3339 [2022-04-15 18:04:47,921 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-15 18:04:47,921 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-15 18:04:47,922 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-15 18:04:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-15 18:04:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-15 18:04:48,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:48,157 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-15 18:04:48,159 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-15 18:04:48,161 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-15 18:04:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:48,465 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-15 18:04:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-15 18:04:48,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:48,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:48,472 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-15 18:04:48,474 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-15 18:04:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:48,794 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-15 18:04:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-15 18:04:48,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:48,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:48,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:48,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:48,801 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-15 18:04:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-15 18:04:49,328 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-15 18:04:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:49,328 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-15 18:04:49,328 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-15 18:04:49,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 4423 transitions. [2022-04-15 18:04:53,577 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-15 18:04:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-15 18:04:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:04:53,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:53,579 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-15 18:04:53,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 18:04:53,580 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-15 18:04:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:53,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370087295] [2022-04-15 18:04:53,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 2 times [2022-04-15 18:04:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:53,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673613520] [2022-04-15 18:04:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:53,617 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-15 18:04:53,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-15 18:04:53,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-15 18:04:53,617 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-15 18:04:53,618 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-15 18:04:53,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {109623#true} call #t~ret14 := main(); {109623#true} is VALID [2022-04-15 18:04:53,618 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-15 18:04:53,618 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-15 18:04:53,618 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-15 18:04:53,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {109623#true} assume !(0 != ~p1~0); {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {109623#true} assume !(0 != ~p2~0); {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {109623#true} assume !(0 != ~p3~0); {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {109623#true} assume !(0 != ~p4~0); {109623#true} is VALID [2022-04-15 18:04:53,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {109623#true} assume !(0 != ~p5~0); {109623#true} is VALID [2022-04-15 18:04:53,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {109623#true} assume !(0 != ~p6~0); {109623#true} is VALID [2022-04-15 18:04:53,624 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-15 18:04:53,625 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-15 18:04:53,625 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-15 18:04:53,625 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-15 18:04:53,626 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-15 18:04:53,626 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-15 18:04:53,626 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-15 18:04:53,627 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-15 18:04:53,627 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-15 18:04:53,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {109624#false} is VALID [2022-04-15 18:04:53,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {109624#false} assume 0 != ~p8~0; {109624#false} is VALID [2022-04-15 18:04:53,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {109624#false} assume 1 != ~lk8~0; {109624#false} is VALID [2022-04-15 18:04:53,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {109624#false} assume !false; {109624#false} is VALID [2022-04-15 18:04:53,628 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-15 18:04:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673613520] [2022-04-15 18:04:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673613520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:53,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:53,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:53,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370087295] [2022-04-15 18:04:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370087295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:53,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:53,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304846266] [2022-04-15 18:04:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:53,629 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-15 18:04:53,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:53,629 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-15 18:04:53,646 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-15 18:04:53,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:53,647 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-15 18:04:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:54,979 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-15 18:04:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:04:54,979 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-15 18:04:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:04:54,979 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-15 18:04:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 18:04:54,980 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-15 18:04:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 18:04:54,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 18:04:55,072 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-15 18:04:55,595 INFO L225 Difference]: With dead ends: 5005 [2022-04-15 18:04:55,595 INFO L226 Difference]: Without dead ends: 3403 [2022-04-15 18:04:55,597 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-15 18:04:55,597 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-15 18:04:55,598 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-15 18:04:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-15 18:04:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-15 18:04:55,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:04:55,816 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-15 18:04:55,818 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-15 18:04:55,820 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-15 18:04:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:56,129 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-15 18:04:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-15 18:04:56,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:56,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:56,136 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-15 18:04:56,138 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-15 18:04:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:04:56,467 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-15 18:04:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-15 18:04:56,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:04:56,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:04:56,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:04:56,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:04:56,473 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-15 18:04:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-15 18:04:57,027 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-15 18:04:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:04:57,027 INFO L478 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-15 18:04:57,028 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-15 18:04:57,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3401 states and 4423 transitions. [2022-04-15 18:05:01,360 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-15 18:05:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-15 18:05:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:05:01,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:01,363 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-15 18:05:01,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 18:05:01,363 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-15 18:05:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:01,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240044998] [2022-04-15 18:05:01,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 2 times [2022-04-15 18:05:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:01,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552435679] [2022-04-15 18:05:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:01,394 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-15 18:05:01,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-15 18:05:01,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-15 18:05:01,395 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-15 18:05:01,395 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-15 18:05:01,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-15 18:05:01,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-15 18:05:01,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {133253#true} call #t~ret14 := main(); {133253#true} is VALID [2022-04-15 18:05:01,395 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-15 18:05:01,395 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-15 18:05:01,395 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-15 18:05:01,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {133253#true} assume !(0 != ~p1~0); {133253#true} is VALID [2022-04-15 18:05:01,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {133253#true} assume !(0 != ~p2~0); {133253#true} is VALID [2022-04-15 18:05:01,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {133253#true} assume !(0 != ~p3~0); {133253#true} is VALID [2022-04-15 18:05:01,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {133253#true} assume !(0 != ~p4~0); {133253#true} is VALID [2022-04-15 18:05:01,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {133253#true} assume !(0 != ~p5~0); {133253#true} is VALID [2022-04-15 18:05:01,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {133253#true} assume !(0 != ~p6~0); {133253#true} is VALID [2022-04-15 18:05:01,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {133253#true} assume !(0 != ~p7~0); {133253#true} is VALID [2022-04-15 18:05:01,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {133253#true} assume 0 != ~p8~0;~lk8~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,396 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-15 18:05:01,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p8~0; {133258#(= main_~lk8~0 1)} is VALID [2022-04-15 18:05:01,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {133258#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {133254#false} is VALID [2022-04-15 18:05:01,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {133254#false} assume !false; {133254#false} is VALID [2022-04-15 18:05:01,399 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-15 18:05:01,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:01,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552435679] [2022-04-15 18:05:01,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552435679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:01,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:01,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:01,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240044998] [2022-04-15 18:05:01,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240044998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:01,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:01,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147392449] [2022-04-15 18:05:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:01,400 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-15 18:05:01,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:01,400 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-15 18:05:01,415 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-15 18:05:01,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:01,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:01,416 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-15 18:05:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:03,254 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-15 18:05:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:03,254 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-15 18:05:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:03,254 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-15 18:05:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 18:05:03,256 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-15 18:05:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 18:05:03,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 18:05:03,315 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-15 18:05:04,528 INFO L225 Difference]: With dead ends: 5645 [2022-04-15 18:05:04,528 INFO L226 Difference]: Without dead ends: 5643 [2022-04-15 18:05:04,529 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-15 18:05:04,530 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-15 18:05:04,530 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-15 18:05:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-15 18:05:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-15 18:05:04,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:05:04,914 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-15 18:05:04,917 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-15 18:05:04,920 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-15 18:05:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:05,730 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-15 18:05:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-15 18:05:05,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:05,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:05,742 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-15 18:05:05,745 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-15 18:05:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:06,574 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-15 18:05:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-15 18:05:06,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:06,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:06,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:06,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:06,585 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-15 18:05:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-15 18:05:07,745 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-15 18:05:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:07,745 INFO L478 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-15 18:05:07,745 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-15 18:05:07,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5129 states and 6471 transitions. [2022-04-15 18:05:14,341 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-15 18:05:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-15 18:05:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 18:05:14,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:14,346 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-15 18:05:14,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 18:05:14,346 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-15 18:05:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:14,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020519981] [2022-04-15 18:05:14,347 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 2 times [2022-04-15 18:05:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:14,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799109917] [2022-04-15 18:05:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:14,403 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-15 18:05:14,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-15 18:05:14,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-15 18:05:14,404 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-15 18:05:14,404 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-15 18:05:14,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-15 18:05:14,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-15 18:05:14,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {166099#true} call #t~ret14 := main(); {166099#true} is VALID [2022-04-15 18:05:14,404 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-15 18:05:14,404 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-15 18:05:14,404 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-15 18:05:14,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {166099#true} assume !(0 != ~p1~0); {166099#true} is VALID [2022-04-15 18:05:14,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {166099#true} assume !(0 != ~p2~0); {166099#true} is VALID [2022-04-15 18:05:14,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {166099#true} assume !(0 != ~p3~0); {166099#true} is VALID [2022-04-15 18:05:14,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {166099#true} assume !(0 != ~p4~0); {166099#true} is VALID [2022-04-15 18:05:14,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {166099#true} assume !(0 != ~p5~0); {166099#true} is VALID [2022-04-15 18:05:14,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {166099#true} assume !(0 != ~p6~0); {166099#true} is VALID [2022-04-15 18:05:14,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {166099#true} assume !(0 != ~p7~0); {166099#true} is VALID [2022-04-15 18:05:14,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {166099#true} assume !(0 != ~p8~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,405 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-15 18:05:14,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p1~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p2~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p3~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p4~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p5~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p6~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p7~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-15 18:05:14,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p8~0; {166100#false} is VALID [2022-04-15 18:05:14,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {166100#false} assume 1 != ~lk8~0; {166100#false} is VALID [2022-04-15 18:05:14,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {166100#false} assume !false; {166100#false} is VALID [2022-04-15 18:05:14,407 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-15 18:05:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799109917] [2022-04-15 18:05:14,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799109917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:14,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:14,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:14,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:14,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020519981] [2022-04-15 18:05:14,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020519981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:14,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:14,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252560893] [2022-04-15 18:05:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:14,409 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-15 18:05:14,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:14,409 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-15 18:05:14,418 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-15 18:05:14,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:14,419 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-15 18:05:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:20,461 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-15 18:05:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:20,461 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-15 18:05:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:20,462 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-15 18:05:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-15 18:05:20,463 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-15 18:05:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-15 18:05:20,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-15 18:05:20,536 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-15 18:05:22,423 INFO L225 Difference]: With dead ends: 11533 [2022-04-15 18:05:22,424 INFO L226 Difference]: Without dead ends: 6539 [2022-04-15 18:05:22,429 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-15 18:05:22,431 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-15 18:05:22,431 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-15 18:05:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-15 18:05:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-15 18:05:22,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:05:22,922 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-15 18:05:22,931 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-15 18:05:22,938 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-15 18:05:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:24,107 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-15 18:05:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-15 18:05:24,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:24,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:24,120 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-15 18:05:24,127 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-15 18:05:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:25,411 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-15 18:05:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-15 18:05:25,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:25,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:25,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:25,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:25,423 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-15 18:05:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-15 18:05:27,426 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-15 18:05:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:27,426 INFO L478 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-15 18:05:27,426 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-15 18:05:27,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6537 states and 7943 transitions. [2022-04-15 18:05:34,181 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-15 18:05:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-15 18:05:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 18:05:34,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:34,186 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-15 18:05:34,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 18:05:34,186 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-15 18:05:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838559543] [2022-04-15 18:05:34,187 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 2 times [2022-04-15 18:05:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338709484] [2022-04-15 18:05:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:34,229 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-15 18:05:34,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-15 18:05:34,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-15 18:05:34,230 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-15 18:05:34,230 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-15 18:05:34,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-15 18:05:34,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-15 18:05:34,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {215329#true} call #t~ret14 := main(); {215329#true} is VALID [2022-04-15 18:05:34,230 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-15 18:05:34,230 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-15 18:05:34,231 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-15 18:05:34,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {215329#true} assume !(0 != ~p1~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {215329#true} assume !(0 != ~p2~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {215329#true} assume !(0 != ~p3~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {215329#true} assume !(0 != ~p4~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {215329#true} assume !(0 != ~p5~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {215329#true} assume !(0 != ~p6~0); {215329#true} is VALID [2022-04-15 18:05:34,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {215329#true} assume !(0 != ~p7~0); {215329#true} is VALID [2022-04-15 18:05:34,231 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-15 18:05:34,231 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-15 18:05:34,232 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-15 18:05:34,232 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-15 18:05:34,232 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-15 18:05:34,232 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-15 18:05:34,232 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-15 18:05:34,233 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-15 18:05:34,233 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-15 18:05:34,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {215330#false} is VALID [2022-04-15 18:05:34,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {215330#false} assume 0 != ~p9~0; {215330#false} is VALID [2022-04-15 18:05:34,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {215330#false} assume 1 != ~lk9~0; {215330#false} is VALID [2022-04-15 18:05:34,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {215330#false} assume !false; {215330#false} is VALID [2022-04-15 18:05:34,233 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-15 18:05:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338709484] [2022-04-15 18:05:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338709484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:34,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838559543] [2022-04-15 18:05:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838559543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406232820] [2022-04-15 18:05:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:34,235 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-15 18:05:34,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:34,235 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-15 18:05:34,244 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-15 18:05:34,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:34,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:34,245 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-15 18:05:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:38,783 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-15 18:05:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:38,783 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-15 18:05:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:38,783 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-15 18:05:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 18:05:38,784 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-15 18:05:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 18:05:38,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-15 18:05:38,862 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-15 18:05:40,784 INFO L225 Difference]: With dead ends: 9805 [2022-04-15 18:05:40,784 INFO L226 Difference]: Without dead ends: 6667 [2022-04-15 18:05:40,788 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-15 18:05:40,788 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-15 18:05:40,788 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-15 18:05:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-15 18:05:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-15 18:05:41,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:05:41,275 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-15 18:05:41,281 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-15 18:05:41,287 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-15 18:05:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:42,525 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-15 18:05:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-15 18:05:42,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:42,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:42,540 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-15 18:05:42,550 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-15 18:05:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:43,768 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-15 18:05:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-15 18:05:43,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:43,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:43,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:43,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:43,780 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-15 18:05:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-15 18:05:45,839 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-15 18:05:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:45,839 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-15 18:05:45,840 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-15 18:05:45,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 7943 transitions. [2022-04-15 18:05:53,825 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-15 18:05:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-15 18:05:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 18:05:53,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:53,829 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-15 18:05:53,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 18:05:53,829 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-15 18:05:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:53,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110357146] [2022-04-15 18:05:53,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 2 times [2022-04-15 18:05:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:53,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627804764] [2022-04-15 18:05:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:53,880 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-15 18:05:53,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-15 18:05:53,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-15 18:05:53,880 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-15 18:05:53,880 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-15 18:05:53,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {261615#true} call #t~ret14 := main(); {261615#true} is VALID [2022-04-15 18:05:53,881 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-15 18:05:53,881 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-15 18:05:53,881 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-15 18:05:53,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {261615#true} assume !(0 != ~p1~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {261615#true} assume !(0 != ~p2~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {261615#true} assume !(0 != ~p3~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {261615#true} assume !(0 != ~p4~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {261615#true} assume !(0 != ~p5~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {261615#true} assume !(0 != ~p6~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {261615#true} assume !(0 != ~p7~0); {261615#true} is VALID [2022-04-15 18:05:53,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {261615#true} assume !(0 != ~p8~0); {261615#true} is VALID [2022-04-15 18:05:53,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {261615#true} assume 0 != ~p9~0;~lk9~0 := 1; {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {261620#(= main_~lk9~0 1)} assume 0 != ~p9~0; {261620#(= main_~lk9~0 1)} is VALID [2022-04-15 18:05:53,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {261620#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {261616#false} is VALID [2022-04-15 18:05:53,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {261616#false} assume !false; {261616#false} is VALID [2022-04-15 18:05:53,884 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-15 18:05:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627804764] [2022-04-15 18:05:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627804764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:53,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:53,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:53,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110357146] [2022-04-15 18:05:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110357146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:53,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:53,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:05:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582076365] [2022-04-15 18:05:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:53,886 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-15 18:05:53,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:53,887 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-15 18:05:53,899 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-15 18:05:53,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:05:53,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:05:53,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:05:53,900 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-15 18:05:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:59,537 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-15 18:05:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:05:59,538 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-15 18:05:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:59,538 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-15 18:05:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-15 18:05:59,539 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-15 18:05:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-15 18:05:59,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-15 18:05:59,595 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-15 18:06:04,083 INFO L225 Difference]: With dead ends: 10763 [2022-04-15 18:06:04,083 INFO L226 Difference]: Without dead ends: 10761 [2022-04-15 18:06:04,085 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-15 18:06:04,085 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-15 18:06:04,085 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-15 18:06:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-15 18:06:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-15 18:06:04,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:04,889 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-15 18:06:04,895 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-15 18:06:04,901 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-15 18:06:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:07,773 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-15 18:06:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-15 18:06:07,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:07,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:07,788 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-15 18:06:07,795 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-15 18:06:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:10,643 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-15 18:06:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-15 18:06:10,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:10,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:10,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:10,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:10,660 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-15 18:06:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-15 18:06:15,105 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-15 18:06:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:15,105 INFO L478 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-15 18:06:15,105 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-15 18:06:15,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10249 states and 11911 transitions. [2022-04-15 18:06:26,068 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-15 18:06:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-15 18:06:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 18:06:26,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:06:26,075 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-15 18:06:26,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 18:06:26,075 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:06:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:06:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-15 18:06:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167496102] [2022-04-15 18:06:26,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:06:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 2 times [2022-04-15 18:06:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:06:26,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337528153] [2022-04-15 18:06:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:06:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:06:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:06:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:26,123 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-15 18:06:26,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-15 18:06:26,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-15 18:06:26,123 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-15 18:06:26,123 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-15 18:06:26,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {325173#true} call #t~ret14 := main(); {325173#true} is VALID [2022-04-15 18:06:26,124 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-15 18:06:26,124 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-15 18:06:26,124 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-15 18:06:26,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {325173#true} assume !(0 != ~p1~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {325173#true} assume !(0 != ~p2~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {325173#true} assume !(0 != ~p3~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {325173#true} assume !(0 != ~p4~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {325173#true} assume !(0 != ~p5~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {325173#true} assume !(0 != ~p6~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {325173#true} assume !(0 != ~p7~0); {325173#true} is VALID [2022-04-15 18:06:26,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {325173#true} assume !(0 != ~p8~0); {325173#true} is VALID [2022-04-15 18:06:26,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {325173#true} assume !(0 != ~p9~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p1~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p2~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p3~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p4~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p5~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p6~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p7~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p8~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-15 18:06:26,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {325178#(= main_~p9~0 0)} assume 0 != ~p9~0; {325174#false} is VALID [2022-04-15 18:06:26,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {325174#false} assume 1 != ~lk9~0; {325174#false} is VALID [2022-04-15 18:06:26,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {325174#false} assume !false; {325174#false} is VALID [2022-04-15 18:06:26,128 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-15 18:06:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:06:26,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337528153] [2022-04-15 18:06:26,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337528153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:26,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:26,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:06:26,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:06:26,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167496102] [2022-04-15 18:06:26,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167496102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:26,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:26,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:06:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760508364] [2022-04-15 18:06:26,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:06:26,129 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-15 18:06:26,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:06:26,129 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-15 18:06:26,145 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-15 18:06:26,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:06:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:06:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:06:26,145 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-15 18:06:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:49,062 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-15 18:06:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:06:49,062 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-15 18:06:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:49,062 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-15 18:06:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 18:06:49,063 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-15 18:06:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 18:06:49,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-15 18:06:49,136 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-15 18:06:49,136 INFO L225 Difference]: With dead ends: 22793 [2022-04-15 18:06:49,136 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 18:06:49,188 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-15 18:06:49,189 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-15 18:06:49,189 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-15 18:06:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 18:06:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 18:06:49,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:49,190 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-15 18:06:49,190 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-15 18:06:49,190 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-15 18:06:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:49,190 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:06:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:49,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:49,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:49,190 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-15 18:06:49,190 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-15 18:06:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:49,190 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:06:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:49,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:49,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:49,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:49,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:49,191 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-15 18:06:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 18:06:49,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-15 18:06:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:49,204 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 18:06:49,204 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-15 18:06:49,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 18:06:49,204 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-15 18:06:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:06:49,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:49,207 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 18:06:49,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:06:49,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 18:06:58,394 WARN L232 SmtUtils]: Spent 7.44s 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-15 18:07:04,724 WARN L232 SmtUtils]: Spent 6.33s 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-15 18:07:56,010 WARN L232 SmtUtils]: Spent 38.17s 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-15 18:08:42,799 WARN L232 SmtUtils]: Spent 38.51s 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-15 18:08:47,840 WARN L232 SmtUtils]: Spent 5.04s 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-15 18:09:06,567 WARN L232 SmtUtils]: Spent 8.94s 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-15 18:09:21,678 WARN L232 SmtUtils]: Spent 15.11s 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-15 18:09:49,797 WARN L232 SmtUtils]: Spent 28.12s 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-15 18:10:05,652 WARN L232 SmtUtils]: Spent 12.26s 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-15 18:10:19,802 WARN L232 SmtUtils]: Spent 6.51s 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-15 18:10:30,507 WARN L232 SmtUtils]: Spent 6.48s 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-15 18:10:48,517 WARN L232 SmtUtils]: Spent 18.01s 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-15 18:11:10,972 WARN L232 SmtUtils]: Spent 22.44s 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-15 18:11:21,118 WARN L232 SmtUtils]: Spent 10.14s 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-15 18:11:26,660 WARN L232 SmtUtils]: Spent 5.53s 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-15 18:11:36,442 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-15 18:11:45,023 WARN L232 SmtUtils]: Spent 8.56s 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-15 18:12:17,113 WARN L232 SmtUtils]: Spent 6.01s 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-15 18:12:30,650 WARN L232 SmtUtils]: Spent 9.83s 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-15 18:12:43,481 WARN L232 SmtUtils]: Spent 10.28s 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-15 18:12:49,293 WARN L232 SmtUtils]: Spent 5.79s 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-15 18:13:17,907 WARN L232 SmtUtils]: Spent 27.23s 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-15 18:13:30,885 WARN L232 SmtUtils]: Spent 12.95s 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-15 18:13:46,539 WARN L232 SmtUtils]: Spent 15.63s 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-15 18:13:57,160 WARN L232 SmtUtils]: Spent 7.21s 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-15 18:14:05,431 WARN L232 SmtUtils]: Spent 8.26s 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-15 18:14:13,920 WARN L232 SmtUtils]: Spent 8.48s 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-15 18:14:13,929 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 18:14:13,929 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 18:14:13,929 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 18:14:13,929 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,929 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-15 18:14:13,929 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,930 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,930 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 18:14:13,930 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-15 18:14:13,930 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 151) the Hoare annotation is: true [2022-04-15 18:14:13,932 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-15 18:14:13,932 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-15 18:14:13,932 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-15 18:14:13,933 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-15 18:14:13,935 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-15 18:14:13,935 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-15 18:14:13,936 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-15 18:14:13,936 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-15 18:14:13,936 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 151) the Hoare annotation is: true [2022-04-15 18:14:13,936 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-15 18:14:13,936 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-15 18:14:13,936 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) the Hoare annotation is: false [2022-04-15 18:14:13,936 INFO L885 garLoopResultBuilder]: At program point L63(lines 63 65) the Hoare annotation is: true [2022-04-15 18:14:13,936 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-15 18:14:13,936 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-15 18:14:13,936 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-15 18:14:13,936 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-15 18:14:13,937 INFO L885 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-15 18:14:13,937 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-15 18:14:13,937 INFO L885 garLoopResultBuilder]: At program point L40(lines 40 42) the Hoare annotation is: true [2022-04-15 18:14:13,937 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-15 18:14:13,938 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-15 18:14:13,938 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-15 18:14:13,939 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-15 18:14:13,948 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-15 18:14:13,948 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-15 18:14:13,948 INFO L885 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-15 18:14:13,948 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-15 18:14:13,948 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-15 18:14:13,948 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-15 18:14:13,949 INFO L878 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (= main_~lk9~0 1) [2022-04-15 18:14:13,949 INFO L878 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-15 18:14:13,949 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-15 18:14:13,957 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-15 18:14:13,958 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 18:14:13,965 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 18:14:13,966 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 18:14:14,300 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-15 18:14:14,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:14:14 BoogieIcfgContainer [2022-04-15 18:14:14,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 18:14:14,308 INFO L158 Benchmark]: Toolchain (without parser) took 596261.05ms. Allocated memory was 205.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 149.1MB in the beginning and 374.0MB in the end (delta: -224.9MB). Peak memory consumption was 862.0MB. Max. memory is 8.0GB. [2022-04-15 18:14:14,308 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:14:14,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.85ms. Allocated memory was 205.5MB in the beginning and 295.7MB in the end (delta: 90.2MB). Free memory was 148.9MB in the beginning and 265.2MB in the end (delta: -116.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-15 18:14:14,310 INFO L158 Benchmark]: Boogie Preprocessor took 35.31ms. Allocated memory is still 295.7MB. Free memory was 265.2MB in the beginning and 263.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 18:14:14,311 INFO L158 Benchmark]: RCFGBuilder took 376.93ms. Allocated memory is still 295.7MB. Free memory was 263.1MB in the beginning and 249.5MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 18:14:14,312 INFO L158 Benchmark]: TraceAbstraction took 595645.80ms. Allocated memory was 295.7MB in the beginning and 1.3GB in the end (delta: 983.6MB). Free memory was 249.0MB in the beginning and 374.0MB in the end (delta: -125.0MB). Peak memory consumption was 870.8MB. Max. memory is 8.0GB. [2022-04-15 18:14:14,316 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.12ms. Allocated memory is still 205.5MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.85ms. Allocated memory was 205.5MB in the beginning and 295.7MB in the end (delta: 90.2MB). Free memory was 148.9MB in the beginning and 265.2MB in the end (delta: -116.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.31ms. Allocated memory is still 295.7MB. Free memory was 265.2MB in the beginning and 263.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 376.93ms. Allocated memory is still 295.7MB. Free memory was 263.1MB in the beginning and 249.5MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 595645.80ms. Allocated memory was 295.7MB in the beginning and 1.3GB in the end (delta: 983.6MB). Free memory was 249.0MB in the beginning and 374.0MB in the end (delta: -125.0MB). Peak memory consumption was 870.8MB. 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: 595.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 62.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 444.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: 30.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 12851 NumberOfFragments, 51244 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 271.9s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2169939 FormulaSimplificationTreeSizeReductionInter, 172.6s 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-15 18:14:14,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...