/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:22:23,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:22:23,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:22:23,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:22:23,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:22:23,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:22:23,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:22:23,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:22:23,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:22:23,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:22:23,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:22:23,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:22:23,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:22:23,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:22:23,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:22:23,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:22:23,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:22:23,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:22:23,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:22:23,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:22:23,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:22:23,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:22:23,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:22:23,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:22:23,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:22:23,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:22:23,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:22:23,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:22:23,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:22:23,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:22:23,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:22:23,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:22:23,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:22:23,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:22:23,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:22:23,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:22:23,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:22:23,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:22:23,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:22:23,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:22:23,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:22:23,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:22:23,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:22:23,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:22:23,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:22:23,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:22:23,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:22:23,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:22:23,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:22:23,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:22:23,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:22:23,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:22:23,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:22:23,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:23,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:22:23,972 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:22:23,973 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-28 08:22:24,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:22:24,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:22:24,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:22:24,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:22:24,228 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:22:24,229 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-28 08:22:24,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7206a2d65/5efe7e23556d432dbec18e0669746d50/FLAG705013323 [2022-04-28 08:22:24,683 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:22:24,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-28 08:22:24,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7206a2d65/5efe7e23556d432dbec18e0669746d50/FLAG705013323 [2022-04-28 08:22:24,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7206a2d65/5efe7e23556d432dbec18e0669746d50 [2022-04-28 08:22:24,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:22:24,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:22:24,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:24,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:22:24,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:22:24,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:24" (1/1) ... [2022-04-28 08:22:24,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e06c078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:24, skipping insertion in model container [2022-04-28 08:22:24,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:24" (1/1) ... [2022-04-28 08:22:24,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:22:24,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:22:24,965 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-28 08:22:24,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:24,982 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:22:25,021 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-28 08:22:25,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:25,032 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:22:25,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25 WrapperNode [2022-04-28 08:22:25,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:25,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:22:25,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:22:25,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:22:25,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:22:25,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:22:25,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:22:25,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:22:25,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (1/1) ... [2022-04-28 08:22:25,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:25,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:22:25,103 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-28 08:22:25,116 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-28 08:22:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:22:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:22:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:22:25,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:22:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:22:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:22:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:22:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:22:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:22:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:22:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:22:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:22:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:22:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:22:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:22:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:22:25,243 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:22:25,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:22:25,509 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:22:25,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:22:25,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:22:25,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:22:25 BoogieIcfgContainer [2022-04-28 08:22:25,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:22:25,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:22:25,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:22:25,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:22:25,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:22:24" (1/3) ... [2022-04-28 08:22:25,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aff0822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:22:25, skipping insertion in model container [2022-04-28 08:22:25,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:25" (2/3) ... [2022-04-28 08:22:25,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aff0822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:22:25, skipping insertion in model container [2022-04-28 08:22:25,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:22:25" (3/3) ... [2022-04-28 08:22:25,528 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-28 08:22:25,539 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:22:25,539 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:22:25,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:22:25,595 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f37a341, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62746751 [2022-04-28 08:22:25,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:22:25,605 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-28 08:22:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:22:25,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:25,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:22:25,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-28 08:22:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:25,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958628445] [2022-04-28 08:22:25,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 2 times [2022-04-28 08:22:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:25,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236646941] [2022-04-28 08:22:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:25,886 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-28 08:22:25,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-28 08:22:25,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-28 08:22:25,888 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-28 08:22:25,888 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-28 08:22:25,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2022-04-28 08:22:25,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #183#return; {45#true} is VALID [2022-04-28 08:22:25,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2022-04-28 08:22:25,889 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-28 08:22:25,890 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-28 08:22:25,890 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-28 08:22:25,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} assume 0 != ~p1~0;~lk1~0 := 1; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 08:22:25,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {50#(= main_~lk1~0 1)} is VALID [2022-04-28 08:22:25,895 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-28 08:22:25,896 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-28 08:22:25,897 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-28 08:22:25,897 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-28 08:22:25,898 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-28 08:22:25,898 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-28 08:22:25,899 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-28 08:22:25,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} assume 0 != ~p1~0; {50#(= main_~lk1~0 1)} is VALID [2022-04-28 08:22:25,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {46#false} is VALID [2022-04-28 08:22:25,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-04-28 08:22:25,900 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-28 08:22:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236646941] [2022-04-28 08:22:25,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236646941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:25,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:25,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:25,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:25,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958628445] [2022-04-28 08:22:25,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958628445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:25,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:25,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65671276] [2022-04-28 08:22:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:25,909 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-28 08:22:25,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:25,913 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-28 08:22:25,935 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-28 08:22:25,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:25,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:25,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:25,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:25,954 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-28 08:22:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:26,276 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-28 08:22:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:26,277 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-28 08:22:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:26,279 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-28 08:22:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:22:26,293 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-28 08:22:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:22:26,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 08:22:26,435 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-28 08:22:26,447 INFO L225 Difference]: With dead ends: 82 [2022-04-28 08:22:26,447 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 08:22:26,450 INFO L412 NwaCegarLoop]: 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-28 08:22:26,455 INFO L413 NwaCegarLoop]: 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-28 08:22:26,456 INFO L414 NwaCegarLoop]: 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-28 08:22:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 08:22:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-28 08:22:26,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:26,497 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-28 08:22:26,498 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-28 08:22:26,499 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-28 08:22:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:26,507 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 08:22:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 08:22:26,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:26,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:26,508 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-28 08:22:26,509 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-28 08:22:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:26,513 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-28 08:22:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-28 08:22:26,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:26,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:26,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:26,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:26,515 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-28 08:22:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-28 08:22:26,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-28 08:22:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:26,520 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-28 08:22:26,520 INFO L496 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-28 08:22:26,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 82 transitions. [2022-04-28 08:22:26,616 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-28 08:22:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-28 08:22:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:22:26,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:26,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:22:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:22:26,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-28 08:22:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598826005] [2022-04-28 08:22:26,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 2 times [2022-04-28 08:22:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:26,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723967000] [2022-04-28 08:22:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:26,680 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-28 08:22:26,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 08:22:26,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-28 08:22:26,682 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-28 08:22:26,682 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-28 08:22:26,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 08:22:26,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #183#return; {449#true} is VALID [2022-04-28 08:22:26,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret14 := main(); {449#true} is VALID [2022-04-28 08:22:26,683 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-28 08:22:26,683 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-28 08:22:26,683 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-28 08:22:26,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} assume !(0 != ~p1~0); {454#(= main_~p1~0 0)} is VALID [2022-04-28 08:22:26,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~p1~0 0)} assume !(0 != ~p2~0); {454#(= main_~p1~0 0)} is VALID [2022-04-28 08:22:26,685 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-28 08:22:26,685 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-28 08:22:26,685 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-28 08:22:26,686 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-28 08:22:26,686 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-28 08:22:26,687 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-28 08:22:26,688 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-28 08:22:26,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#(= main_~p1~0 0)} assume 0 != ~p1~0; {450#false} is VALID [2022-04-28 08:22:26,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#false} assume 1 != ~lk1~0; {450#false} is VALID [2022-04-28 08:22:26,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-28 08:22:26,689 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-28 08:22:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:26,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723967000] [2022-04-28 08:22:26,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723967000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:26,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:26,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:26,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598826005] [2022-04-28 08:22:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598826005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:26,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:26,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460780514] [2022-04-28 08:22:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:26,692 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-28 08:22:26,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:26,693 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-28 08:22:26,711 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-28 08:22:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:26,712 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-28 08:22:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:26,920 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-28 08:22:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:26,921 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-28 08:22:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:26,921 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-28 08:22:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 08:22:26,924 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-28 08:22:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-28 08:22:26,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-28 08:22:27,063 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-28 08:22:27,066 INFO L225 Difference]: With dead ends: 108 [2022-04-28 08:22:27,066 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 08:22:27,069 INFO L412 NwaCegarLoop]: 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-28 08:22:27,070 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:22:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:22:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 08:22:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-28 08:22:27,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:27,079 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-28 08:22:27,080 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-28 08:22:27,080 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-28 08:22:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:27,083 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 08:22:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 08:22:27,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:27,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:27,085 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-28 08:22:27,085 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-28 08:22:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:27,088 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-28 08:22:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-28 08:22:27,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:27,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:27,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:27,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:27,089 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-28 08:22:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-28 08:22:27,092 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-28 08:22:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:27,092 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-28 08:22:27,093 INFO L496 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-28 08:22:27,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 114 transitions. [2022-04-28 08:22:27,192 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-28 08:22:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-28 08:22:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:22:27,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:27,193 INFO L195 NwaCegarLoop]: 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-28 08:22:27,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:22:27,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-28 08:22:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636382390] [2022-04-28 08:22:27,195 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 2 times [2022-04-28 08:22:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216502364] [2022-04-28 08:22:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:27,246 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-28 08:22:27,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-28 08:22:27,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-28 08:22:27,247 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-28 08:22:27,247 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-28 08:22:27,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-28 08:22:27,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #183#return; {941#true} is VALID [2022-04-28 08:22:27,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret14 := main(); {941#true} is VALID [2022-04-28 08:22:27,248 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-28 08:22:27,248 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-28 08:22:27,248 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-28 08:22:27,249 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-28 08:22:27,249 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-28 08:22:27,249 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-28 08:22:27,250 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-28 08:22:27,250 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-28 08:22:27,251 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-28 08:22:27,251 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-28 08:22:27,251 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-28 08:22:27,252 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-28 08:22:27,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {946#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {942#false} is VALID [2022-04-28 08:22:27,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume 0 != ~p2~0; {942#false} is VALID [2022-04-28 08:22:27,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {942#false} assume 1 != ~lk2~0; {942#false} is VALID [2022-04-28 08:22:27,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-28 08:22:27,253 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-28 08:22:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:27,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216502364] [2022-04-28 08:22:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216502364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:27,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:27,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:27,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636382390] [2022-04-28 08:22:27,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636382390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:27,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:27,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945356713] [2022-04-28 08:22:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:27,255 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-28 08:22:27,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:27,255 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-28 08:22:27,271 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-28 08:22:27,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:27,272 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-28 08:22:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:27,453 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-28 08:22:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:27,454 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-28 08:22:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:27,454 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-28 08:22:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 08:22:27,457 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-28 08:22:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-28 08:22:27,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-28 08:22:27,605 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-28 08:22:27,617 INFO L225 Difference]: With dead ends: 100 [2022-04-28 08:22:27,617 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 08:22:27,618 INFO L412 NwaCegarLoop]: 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-28 08:22:27,619 INFO L413 NwaCegarLoop]: 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-28 08:22:27,619 INFO L414 NwaCegarLoop]: 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-28 08:22:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 08:22:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-28 08:22:27,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:27,629 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-28 08:22:27,629 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-28 08:22:27,629 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-28 08:22:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:27,632 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 08:22:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 08:22:27,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:27,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:27,633 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-28 08:22:27,633 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-28 08:22:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:27,636 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-28 08:22:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-28 08:22:27,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:27,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:27,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:27,637 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-28 08:22:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-28 08:22:27,639 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-28 08:22:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:27,639 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-28 08:22:27,640 INFO L496 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-28 08:22:27,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 116 transitions. [2022-04-28 08:22:27,750 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-28 08:22:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-28 08:22:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:22:27,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:27,751 INFO L195 NwaCegarLoop]: 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-28 08:22:27,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:22:27,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-28 08:22:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:27,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770326528] [2022-04-28 08:22:27,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 2 times [2022-04-28 08:22:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:27,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759366395] [2022-04-28 08:22:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:27,848 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-28 08:22:27,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-28 08:22:27,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-28 08:22:27,850 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-28 08:22:27,853 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-28 08:22:27,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2022-04-28 08:22:27,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #183#return; {1429#true} is VALID [2022-04-28 08:22:27,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret14 := main(); {1429#true} is VALID [2022-04-28 08:22:27,854 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-28 08:22:27,854 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-28 08:22:27,854 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-28 08:22:27,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1429#true} assume !(0 != ~p1~0); {1429#true} is VALID [2022-04-28 08:22:27,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#true} assume !(0 != ~p2~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-28 08:22:27,857 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-28 08:22:27,861 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-28 08:22:27,863 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-28 08:22:27,866 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-28 08:22:27,866 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-28 08:22:27,867 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-28 08:22:27,867 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-28 08:22:27,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1434#(= main_~p2~0 0)} is VALID [2022-04-28 08:22:27,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#(= main_~p2~0 0)} assume 0 != ~p2~0; {1430#false} is VALID [2022-04-28 08:22:27,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#false} assume 1 != ~lk2~0; {1430#false} is VALID [2022-04-28 08:22:27,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2022-04-28 08:22:27,869 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-28 08:22:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759366395] [2022-04-28 08:22:27,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759366395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:27,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:27,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:27,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770326528] [2022-04-28 08:22:27,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770326528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:27,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:27,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148786943] [2022-04-28 08:22:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:27,870 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-28 08:22:27,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:27,871 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-28 08:22:27,885 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-28 08:22:27,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:27,886 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-28 08:22:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,076 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-28 08:22:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:28,076 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-28 08:22:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:28,077 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-28 08:22:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 08:22:28,079 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-28 08:22:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-28 08:22:28,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-28 08:22:28,208 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-28 08:22:28,211 INFO L225 Difference]: With dead ends: 184 [2022-04-28 08:22:28,211 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 08:22:28,211 INFO L412 NwaCegarLoop]: 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-28 08:22:28,212 INFO L413 NwaCegarLoop]: 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-28 08:22:28,212 INFO L414 NwaCegarLoop]: 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-28 08:22:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 08:22:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-28 08:22:28,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:28,227 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-28 08:22:28,227 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-28 08:22:28,227 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-28 08:22:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,234 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-28 08:22:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-28 08:22:28,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:28,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:28,236 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-28 08:22:28,236 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-28 08:22:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,240 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2022-04-28 08:22:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 214 transitions. [2022-04-28 08:22:28,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:28,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:28,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:28,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:28,242 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-28 08:22:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-28 08:22:28,245 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-28 08:22:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:28,245 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-28 08:22:28,246 INFO L496 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-28 08:22:28,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 213 transitions. [2022-04-28 08:22:28,428 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-28 08:22:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-28 08:22:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:22:28,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:28,429 INFO L195 NwaCegarLoop]: 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-28 08:22:28,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:22:28,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-28 08:22:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:28,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374999723] [2022-04-28 08:22:28,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 2 times [2022-04-28 08:22:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:28,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191381990] [2022-04-28 08:22:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:28,474 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-28 08:22:28,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-28 08:22:28,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-28 08:22:28,475 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-28 08:22:28,476 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-28 08:22:28,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2022-04-28 08:22:28,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #183#return; {2305#true} is VALID [2022-04-28 08:22:28,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret14 := main(); {2305#true} is VALID [2022-04-28 08:22:28,476 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-28 08:22:28,476 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-28 08:22:28,477 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-28 08:22:28,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#true} assume !(0 != ~p1~0); {2305#true} is VALID [2022-04-28 08:22:28,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#true} assume 0 != ~p2~0;~lk2~0 := 1; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 08:22:28,478 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-28 08:22:28,478 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-28 08:22:28,478 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-28 08:22:28,479 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-28 08:22:28,480 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-28 08:22:28,480 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-28 08:22:28,481 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-28 08:22:28,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {2310#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 08:22:28,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {2310#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2310#(= main_~lk2~0 1)} is VALID [2022-04-28 08:22:28,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {2310#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2306#false} is VALID [2022-04-28 08:22:28,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2022-04-28 08:22:28,483 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-28 08:22:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:28,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191381990] [2022-04-28 08:22:28,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191381990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:28,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:28,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:28,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:28,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374999723] [2022-04-28 08:22:28,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374999723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:28,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:28,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294758348] [2022-04-28 08:22:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:28,485 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-28 08:22:28,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:28,486 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-28 08:22:28,509 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-28 08:22:28,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:28,510 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-28 08:22:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,663 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-28 08:22:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:28,663 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-28 08:22:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:28,664 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-28 08:22:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-28 08:22:28,666 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-28 08:22:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-28 08:22:28,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-28 08:22:28,766 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-28 08:22:28,769 INFO L225 Difference]: With dead ends: 159 [2022-04-28 08:22:28,769 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 08:22:28,769 INFO L412 NwaCegarLoop]: 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-28 08:22:28,772 INFO L413 NwaCegarLoop]: 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-28 08:22:28,773 INFO L414 NwaCegarLoop]: 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-28 08:22:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 08:22:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-28 08:22:28,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:28,790 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-28 08:22:28,791 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-28 08:22:28,791 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-28 08:22:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,796 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-28 08:22:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-28 08:22:28,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:28,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:28,797 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-28 08:22:28,797 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-28 08:22:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:28,802 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2022-04-28 08:22:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 272 transitions. [2022-04-28 08:22:28,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:28,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:28,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:28,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:28,803 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-28 08:22:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-28 08:22:28,806 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-28 08:22:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:28,806 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-28 08:22:28,807 INFO L496 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-28 08:22:28,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 211 transitions. [2022-04-28 08:22:28,992 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-28 08:22:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-28 08:22:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:22:28,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:28,993 INFO L195 NwaCegarLoop]: 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-28 08:22:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:22:28,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-28 08:22:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177740932] [2022-04-28 08:22:28,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 2 times [2022-04-28 08:22:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:28,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873838312] [2022-04-28 08:22:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,031 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-28 08:22:29,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-28 08:22:29,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-28 08:22:29,032 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-28 08:22:29,032 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-28 08:22:29,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-04-28 08:22:29,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3195#true} {3195#true} #183#return; {3195#true} is VALID [2022-04-28 08:22:29,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {3195#true} call #t~ret14 := main(); {3195#true} is VALID [2022-04-28 08:22:29,033 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-28 08:22:29,033 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-28 08:22:29,033 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-28 08:22:29,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(0 != ~p1~0); {3195#true} is VALID [2022-04-28 08:22:29,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#true} assume !(0 != ~p2~0); {3195#true} is VALID [2022-04-28 08:22:29,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#true} assume 0 != ~p3~0;~lk3~0 := 1; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 08:22:29,034 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-28 08:22:29,035 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-28 08:22:29,035 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-28 08:22:29,035 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-28 08:22:29,036 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-28 08:22:29,036 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-28 08:22:29,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 08:22:29,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 08:22:29,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3200#(= main_~lk3~0 1)} is VALID [2022-04-28 08:22:29,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3196#false} is VALID [2022-04-28 08:22:29,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#false} assume !false; {3196#false} is VALID [2022-04-28 08:22:29,038 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-28 08:22:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:29,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873838312] [2022-04-28 08:22:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873838312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:29,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177740932] [2022-04-28 08:22:29,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177740932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183029134] [2022-04-28 08:22:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:29,040 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-28 08:22:29,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:29,040 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-28 08:22:29,054 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-28 08:22:29,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:29,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:29,055 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-28 08:22:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:29,215 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-28 08:22:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:29,216 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-28 08:22:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:29,216 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-28 08:22:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:22:29,217 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-28 08:22:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:22:29,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 08:22:29,304 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-28 08:22:29,308 INFO L225 Difference]: With dead ends: 227 [2022-04-28 08:22:29,308 INFO L226 Difference]: Without dead ends: 225 [2022-04-28 08:22:29,309 INFO L412 NwaCegarLoop]: 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-28 08:22:29,309 INFO L413 NwaCegarLoop]: 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-28 08:22:29,310 INFO L414 NwaCegarLoop]: 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-28 08:22:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-28 08:22:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-28 08:22:29,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:29,328 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-28 08:22:29,329 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-28 08:22:29,329 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-28 08:22:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:29,336 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-28 08:22:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-28 08:22:29,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:29,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:29,337 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-28 08:22:29,338 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-28 08:22:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:29,344 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2022-04-28 08:22:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 390 transitions. [2022-04-28 08:22:29,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:29,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:29,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:29,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:29,346 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-28 08:22:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-28 08:22:29,350 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-28 08:22:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:29,351 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-28 08:22:29,351 INFO L496 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-28 08:22:29,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 285 transitions. [2022-04-28 08:22:29,644 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-28 08:22:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-28 08:22:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:22:29,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:29,645 INFO L195 NwaCegarLoop]: 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-28 08:22:29,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:22:29,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-28 08:22:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2064578546] [2022-04-28 08:22:29,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 2 times [2022-04-28 08:22:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:29,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094959312] [2022-04-28 08:22:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:29,688 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-28 08:22:29,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-28 08:22:29,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-28 08:22:29,689 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-28 08:22:29,689 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-28 08:22:29,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {4445#true} assume true; {4445#true} is VALID [2022-04-28 08:22:29,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4445#true} {4445#true} #183#return; {4445#true} is VALID [2022-04-28 08:22:29,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {4445#true} call #t~ret14 := main(); {4445#true} is VALID [2022-04-28 08:22:29,690 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-28 08:22:29,690 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-28 08:22:29,690 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-28 08:22:29,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {4445#true} assume !(0 != ~p1~0); {4445#true} is VALID [2022-04-28 08:22:29,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {4445#true} assume !(0 != ~p2~0); {4445#true} is VALID [2022-04-28 08:22:29,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#true} assume !(0 != ~p3~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 08:22:29,691 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-28 08:22:29,691 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-28 08:22:29,692 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-28 08:22:29,692 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-28 08:22:29,693 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-28 08:22:29,693 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-28 08:22:29,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 08:22:29,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {4450#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4450#(= main_~p3~0 0)} is VALID [2022-04-28 08:22:29,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {4450#(= main_~p3~0 0)} assume 0 != ~p3~0; {4446#false} is VALID [2022-04-28 08:22:29,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#false} assume 1 != ~lk3~0; {4446#false} is VALID [2022-04-28 08:22:29,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#false} assume !false; {4446#false} is VALID [2022-04-28 08:22:29,695 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-28 08:22:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:29,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094959312] [2022-04-28 08:22:29,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094959312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:29,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2064578546] [2022-04-28 08:22:29,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2064578546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:29,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:29,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990356378] [2022-04-28 08:22:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:29,696 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-28 08:22:29,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:29,697 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-28 08:22:29,715 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-28 08:22:29,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:29,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:29,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:29,716 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-28 08:22:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:29,905 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-28 08:22:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:29,905 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-28 08:22:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:29,906 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-28 08:22:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 08:22:29,908 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-28 08:22:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-28 08:22:29,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-28 08:22:30,027 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-28 08:22:30,031 INFO L225 Difference]: With dead ends: 391 [2022-04-28 08:22:30,031 INFO L226 Difference]: Without dead ends: 233 [2022-04-28 08:22:30,032 INFO L412 NwaCegarLoop]: 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-28 08:22:30,033 INFO L413 NwaCegarLoop]: 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-28 08:22:30,033 INFO L414 NwaCegarLoop]: 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-28 08:22:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-28 08:22:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-28 08:22:30,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:30,054 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-28 08:22:30,055 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-28 08:22:30,055 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-28 08:22:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:30,062 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-28 08:22:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-28 08:22:30,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:30,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:30,064 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-28 08:22:30,064 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-28 08:22:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:30,071 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2022-04-28 08:22:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 392 transitions. [2022-04-28 08:22:30,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:30,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:30,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:30,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:30,073 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-28 08:22:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-28 08:22:30,079 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-28 08:22:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:30,079 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-28 08:22:30,080 INFO L496 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-28 08:22:30,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 391 transitions. [2022-04-28 08:22:30,445 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-28 08:22:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-28 08:22:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:22:30,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:30,446 INFO L195 NwaCegarLoop]: 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-28 08:22:30,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:22:30,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-28 08:22:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:30,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957303365] [2022-04-28 08:22:30,447 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 2 times [2022-04-28 08:22:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:30,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71263821] [2022-04-28 08:22:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:30,520 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-28 08:22:30,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 08:22:30,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-28 08:22:30,521 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-28 08:22:30,521 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-28 08:22:30,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2022-04-28 08:22:30,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #183#return; {6167#true} is VALID [2022-04-28 08:22:30,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret14 := main(); {6167#true} is VALID [2022-04-28 08:22:30,522 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-28 08:22:30,522 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-28 08:22:30,522 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-28 08:22:30,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#true} assume !(0 != ~p1~0); {6167#true} is VALID [2022-04-28 08:22:30,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {6167#true} assume !(0 != ~p2~0); {6167#true} is VALID [2022-04-28 08:22:30,523 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-28 08:22:30,524 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-28 08:22:30,524 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-28 08:22:30,524 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-28 08:22:30,525 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-28 08:22:30,525 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-28 08:22:30,525 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-28 08:22:30,526 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-28 08:22:30,526 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-28 08:22:30,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {6172#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6168#false} is VALID [2022-04-28 08:22:30,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#false} assume 0 != ~p4~0; {6168#false} is VALID [2022-04-28 08:22:30,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#false} assume 1 != ~lk4~0; {6168#false} is VALID [2022-04-28 08:22:30,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2022-04-28 08:22:30,528 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-28 08:22:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71263821] [2022-04-28 08:22:30,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71263821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:30,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:30,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:30,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:30,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957303365] [2022-04-28 08:22:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957303365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:30,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638171357] [2022-04-28 08:22:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:30,530 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-28 08:22:30,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:30,530 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-28 08:22:30,546 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-28 08:22:30,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:30,547 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-28 08:22:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:30,755 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-28 08:22:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:30,755 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-28 08:22:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:30,756 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-28 08:22:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:22:30,758 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-28 08:22:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:22:30,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 08:22:30,879 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-28 08:22:30,884 INFO L225 Difference]: With dead ends: 349 [2022-04-28 08:22:30,884 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 08:22:30,885 INFO L412 NwaCegarLoop]: 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-28 08:22:30,886 INFO L413 NwaCegarLoop]: 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-28 08:22:30,886 INFO L414 NwaCegarLoop]: 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-28 08:22:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 08:22:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-28 08:22:30,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:30,904 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-28 08:22:30,905 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-28 08:22:30,905 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-28 08:22:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:30,911 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-28 08:22:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-28 08:22:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:30,912 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-28 08:22:30,913 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-28 08:22:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:30,918 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2022-04-28 08:22:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 396 transitions. [2022-04-28 08:22:30,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:30,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:30,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:30,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:30,920 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-28 08:22:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-28 08:22:30,925 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-28 08:22:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:30,926 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-28 08:22:30,926 INFO L496 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-28 08:22:30,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 395 transitions. [2022-04-28 08:22:31,326 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-28 08:22:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-28 08:22:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:22:31,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:31,327 INFO L195 NwaCegarLoop]: 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-28 08:22:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:22:31,327 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-28 08:22:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:31,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158631624] [2022-04-28 08:22:31,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 2 times [2022-04-28 08:22:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:31,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94174156] [2022-04-28 08:22:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:31,366 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-28 08:22:31,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-28 08:22:31,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-28 08:22:31,367 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-28 08:22:31,367 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-28 08:22:31,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {7829#true} assume true; {7829#true} is VALID [2022-04-28 08:22:31,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7829#true} {7829#true} #183#return; {7829#true} is VALID [2022-04-28 08:22:31,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {7829#true} call #t~ret14 := main(); {7829#true} is VALID [2022-04-28 08:22:31,368 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-28 08:22:31,368 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-28 08:22:31,368 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-28 08:22:31,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {7829#true} assume !(0 != ~p1~0); {7829#true} is VALID [2022-04-28 08:22:31,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {7829#true} assume !(0 != ~p2~0); {7829#true} is VALID [2022-04-28 08:22:31,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {7829#true} assume !(0 != ~p3~0); {7829#true} is VALID [2022-04-28 08:22:31,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {7829#true} assume 0 != ~p4~0;~lk4~0 := 1; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 08:22:31,369 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-28 08:22:31,369 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-28 08:22:31,370 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-28 08:22:31,370 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-28 08:22:31,370 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-28 08:22:31,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 08:22:31,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 08:22:31,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {7834#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 08:22:31,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {7834#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7834#(= main_~lk4~0 1)} is VALID [2022-04-28 08:22:31,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {7834#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7830#false} is VALID [2022-04-28 08:22:31,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {7830#false} assume !false; {7830#false} is VALID [2022-04-28 08:22:31,372 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-28 08:22:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94174156] [2022-04-28 08:22:31,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94174156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:31,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:31,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:31,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158631624] [2022-04-28 08:22:31,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158631624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:31,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:31,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275466730] [2022-04-28 08:22:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:31,374 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-28 08:22:31,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:31,374 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-28 08:22:31,388 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-28 08:22:31,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:31,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:31,389 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-28 08:22:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:31,573 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-28 08:22:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:31,574 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-28 08:22:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:31,574 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-28 08:22:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 08:22:31,575 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-28 08:22:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-28 08:22:31,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-28 08:22:31,656 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-28 08:22:31,668 INFO L225 Difference]: With dead ends: 429 [2022-04-28 08:22:31,668 INFO L226 Difference]: Without dead ends: 427 [2022-04-28 08:22:31,669 INFO L412 NwaCegarLoop]: 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-28 08:22:31,670 INFO L413 NwaCegarLoop]: 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-28 08:22:31,670 INFO L414 NwaCegarLoop]: 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-28 08:22:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-28 08:22:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-28 08:22:31,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:31,696 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-28 08:22:31,696 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-28 08:22:31,697 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-28 08:22:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:31,709 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-28 08:22:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-28 08:22:31,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:31,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:31,710 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-28 08:22:31,711 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-28 08:22:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:31,723 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2022-04-28 08:22:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 716 transitions. [2022-04-28 08:22:31,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:31,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:31,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:31,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:31,725 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-28 08:22:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-28 08:22:31,734 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-28 08:22:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:31,734 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-28 08:22:31,735 INFO L496 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-28 08:22:31,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 539 transitions. [2022-04-28 08:22:32,247 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-28 08:22:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-28 08:22:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:22:32,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:32,251 INFO L195 NwaCegarLoop]: 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-28 08:22:32,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:22:32,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-28 08:22:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:32,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594491505] [2022-04-28 08:22:32,253 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 2 times [2022-04-28 08:22:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341252522] [2022-04-28 08:22:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:32,325 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-28 08:22:32,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 08:22:32,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-28 08:22:32,326 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-28 08:22:32,326 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-28 08:22:32,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 08:22:32,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #183#return; {10211#true} is VALID [2022-04-28 08:22:32,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret14 := main(); {10211#true} is VALID [2022-04-28 08:22:32,327 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-28 08:22:32,327 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-28 08:22:32,327 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-28 08:22:32,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} assume !(0 != ~p1~0); {10211#true} is VALID [2022-04-28 08:22:32,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 != ~p2~0); {10211#true} is VALID [2022-04-28 08:22:32,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume !(0 != ~p3~0); {10211#true} is VALID [2022-04-28 08:22:32,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {10211#true} assume !(0 != ~p4~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 08:22:32,329 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-28 08:22:32,329 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-28 08:22:32,329 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-28 08:22:32,330 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-28 08:22:32,330 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-28 08:22:32,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 08:22:32,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 08:22:32,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {10216#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10216#(= main_~p4~0 0)} is VALID [2022-04-28 08:22:32,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {10216#(= main_~p4~0 0)} assume 0 != ~p4~0; {10212#false} is VALID [2022-04-28 08:22:32,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {10212#false} assume 1 != ~lk4~0; {10212#false} is VALID [2022-04-28 08:22:32,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 08:22:32,335 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-28 08:22:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:32,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341252522] [2022-04-28 08:22:32,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341252522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:32,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:32,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:32,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594491505] [2022-04-28 08:22:32,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594491505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:32,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:32,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119170851] [2022-04-28 08:22:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:32,337 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-28 08:22:32,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:32,337 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-28 08:22:32,355 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-28 08:22:32,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:32,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:32,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:32,356 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-28 08:22:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:32,570 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-28 08:22:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:32,570 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-28 08:22:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:32,570 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-28 08:22:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 08:22:32,572 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-28 08:22:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 08:22:32,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-28 08:22:32,681 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-28 08:22:32,695 INFO L225 Difference]: With dead ends: 765 [2022-04-28 08:22:32,695 INFO L226 Difference]: Without dead ends: 451 [2022-04-28 08:22:32,696 INFO L412 NwaCegarLoop]: 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-28 08:22:32,697 INFO L413 NwaCegarLoop]: 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-28 08:22:32,697 INFO L414 NwaCegarLoop]: 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-28 08:22:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-28 08:22:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-28 08:22:32,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:32,732 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-28 08:22:32,733 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-28 08:22:32,734 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-28 08:22:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:32,746 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-28 08:22:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-28 08:22:32,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:32,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:32,748 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-28 08:22:32,749 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-28 08:22:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:32,762 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2022-04-28 08:22:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 728 transitions. [2022-04-28 08:22:32,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:32,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:32,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:32,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:32,764 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-28 08:22:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-28 08:22:32,780 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-28 08:22:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:32,780 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-28 08:22:32,780 INFO L496 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-28 08:22:32,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 449 states and 727 transitions. [2022-04-28 08:22:33,472 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-28 08:22:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-28 08:22:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:22:33,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:33,473 INFO L195 NwaCegarLoop]: 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-28 08:22:33,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:22:33,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-28 08:22:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:33,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734055948] [2022-04-28 08:22:33,474 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 2 times [2022-04-28 08:22:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:33,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157558356] [2022-04-28 08:22:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:33,512 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-28 08:22:33,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-28 08:22:33,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-28 08:22:33,513 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-28 08:22:33,514 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-28 08:22:33,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {13553#true} assume true; {13553#true} is VALID [2022-04-28 08:22:33,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13553#true} {13553#true} #183#return; {13553#true} is VALID [2022-04-28 08:22:33,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {13553#true} call #t~ret14 := main(); {13553#true} is VALID [2022-04-28 08:22:33,514 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-28 08:22:33,514 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-28 08:22:33,514 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-28 08:22:33,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {13553#true} assume !(0 != ~p1~0); {13553#true} is VALID [2022-04-28 08:22:33,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {13553#true} assume !(0 != ~p2~0); {13553#true} is VALID [2022-04-28 08:22:33,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#true} assume !(0 != ~p3~0); {13553#true} is VALID [2022-04-28 08:22:33,515 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-28 08:22:33,515 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-28 08:22:33,516 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-28 08:22:33,516 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-28 08:22:33,516 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-28 08:22:33,517 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-28 08:22:33,517 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-28 08:22:33,517 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-28 08:22:33,518 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-28 08:22:33,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13554#false} is VALID [2022-04-28 08:22:33,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {13554#false} assume 0 != ~p5~0; {13554#false} is VALID [2022-04-28 08:22:33,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {13554#false} assume 1 != ~lk5~0; {13554#false} is VALID [2022-04-28 08:22:33,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {13554#false} assume !false; {13554#false} is VALID [2022-04-28 08:22:33,519 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-28 08:22:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:33,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157558356] [2022-04-28 08:22:33,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157558356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:33,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:33,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:33,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734055948] [2022-04-28 08:22:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734055948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:33,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:33,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837244717] [2022-04-28 08:22:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:33,520 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-28 08:22:33,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:33,521 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-28 08:22:33,535 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-28 08:22:33,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:33,536 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-28 08:22:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:33,727 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-28 08:22:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:33,727 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-28 08:22:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:33,727 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-28 08:22:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 08:22:33,729 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-28 08:22:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-28 08:22:33,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-28 08:22:33,829 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-28 08:22:33,846 INFO L225 Difference]: With dead ends: 673 [2022-04-28 08:22:33,846 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 08:22:33,847 INFO L412 NwaCegarLoop]: 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-28 08:22:33,848 INFO L413 NwaCegarLoop]: 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-28 08:22:33,848 INFO L414 NwaCegarLoop]: 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-28 08:22:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 08:22:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-28 08:22:33,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:33,893 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-28 08:22:33,894 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-28 08:22:33,895 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-28 08:22:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:33,909 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-28 08:22:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-28 08:22:33,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:33,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:33,910 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-28 08:22:33,911 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-28 08:22:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:33,924 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2022-04-28 08:22:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 728 transitions. [2022-04-28 08:22:33,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:33,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:33,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:33,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:33,926 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-28 08:22:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-28 08:22:33,941 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-28 08:22:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:33,942 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-28 08:22:33,942 INFO L496 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-28 08:22:33,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 727 transitions. [2022-04-28 08:22:34,643 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-28 08:22:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-28 08:22:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:22:34,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:34,645 INFO L195 NwaCegarLoop]: 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-28 08:22:34,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:22:34,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-28 08:22:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:34,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554836642] [2022-04-28 08:22:34,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:34,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 2 times [2022-04-28 08:22:34,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:34,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392283494] [2022-04-28 08:22:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:34,701 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-28 08:22:34,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-28 08:22:34,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-28 08:22:34,702 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-28 08:22:34,702 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-28 08:22:34,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {16743#true} assume true; {16743#true} is VALID [2022-04-28 08:22:34,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16743#true} {16743#true} #183#return; {16743#true} is VALID [2022-04-28 08:22:34,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {16743#true} call #t~ret14 := main(); {16743#true} is VALID [2022-04-28 08:22:34,703 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-28 08:22:34,703 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-28 08:22:34,703 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-28 08:22:34,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {16743#true} assume !(0 != ~p1~0); {16743#true} is VALID [2022-04-28 08:22:34,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {16743#true} assume !(0 != ~p2~0); {16743#true} is VALID [2022-04-28 08:22:34,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {16743#true} assume !(0 != ~p3~0); {16743#true} is VALID [2022-04-28 08:22:34,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {16743#true} assume !(0 != ~p4~0); {16743#true} is VALID [2022-04-28 08:22:34,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#true} assume 0 != ~p5~0;~lk5~0 := 1; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,704 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-28 08:22:34,704 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-28 08:22:34,705 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-28 08:22:34,705 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-28 08:22:34,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {16748#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16748#(= main_~lk5~0 1)} is VALID [2022-04-28 08:22:34,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16744#false} is VALID [2022-04-28 08:22:34,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {16744#false} assume !false; {16744#false} is VALID [2022-04-28 08:22:34,709 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-28 08:22:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392283494] [2022-04-28 08:22:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392283494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:34,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:34,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:34,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:34,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554836642] [2022-04-28 08:22:34,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554836642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:34,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:34,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183623377] [2022-04-28 08:22:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:34,711 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-28 08:22:34,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:34,711 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-28 08:22:34,725 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-28 08:22:34,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:34,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:34,726 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-28 08:22:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:34,964 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-28 08:22:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:34,964 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-28 08:22:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:34,964 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-28 08:22:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:22:34,965 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-28 08:22:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:22:34,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 08:22:35,043 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-28 08:22:35,088 INFO L225 Difference]: With dead ends: 813 [2022-04-28 08:22:35,088 INFO L226 Difference]: Without dead ends: 811 [2022-04-28 08:22:35,088 INFO L412 NwaCegarLoop]: 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-28 08:22:35,089 INFO L413 NwaCegarLoop]: 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-28 08:22:35,089 INFO L414 NwaCegarLoop]: 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-28 08:22:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-28 08:22:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-28 08:22:35,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:35,141 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-28 08:22:35,142 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-28 08:22:35,143 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-28 08:22:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:35,177 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-28 08:22:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-28 08:22:35,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:35,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:35,180 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-28 08:22:35,181 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-28 08:22:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:35,215 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2022-04-28 08:22:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1296 transitions. [2022-04-28 08:22:35,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:35,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:35,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:35,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:35,218 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-28 08:22:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-28 08:22:35,262 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-28 08:22:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:35,262 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-28 08:22:35,263 INFO L496 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-28 08:22:35,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1007 transitions. [2022-04-28 08:22:36,280 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-28 08:22:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-28 08:22:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:22:36,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:36,281 INFO L195 NwaCegarLoop]: 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-28 08:22:36,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:22:36,282 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-28 08:22:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:36,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128142103] [2022-04-28 08:22:36,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 2 times [2022-04-28 08:22:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180762721] [2022-04-28 08:22:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:36,323 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-28 08:22:36,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-28 08:22:36,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-28 08:22:36,324 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-28 08:22:36,324 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-28 08:22:36,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {21301#true} assume true; {21301#true} is VALID [2022-04-28 08:22:36,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21301#true} {21301#true} #183#return; {21301#true} is VALID [2022-04-28 08:22:36,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {21301#true} call #t~ret14 := main(); {21301#true} is VALID [2022-04-28 08:22:36,325 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-28 08:22:36,325 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-28 08:22:36,325 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-28 08:22:36,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {21301#true} assume !(0 != ~p1~0); {21301#true} is VALID [2022-04-28 08:22:36,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {21301#true} assume !(0 != ~p2~0); {21301#true} is VALID [2022-04-28 08:22:36,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {21301#true} assume !(0 != ~p3~0); {21301#true} is VALID [2022-04-28 08:22:36,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {21301#true} assume !(0 != ~p4~0); {21301#true} is VALID [2022-04-28 08:22:36,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {21301#true} assume !(0 != ~p5~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 08:22:36,327 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-28 08:22:36,328 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-28 08:22:36,328 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-28 08:22:36,328 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-28 08:22:36,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p1~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 08:22:36,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p2~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 08:22:36,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p3~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 08:22:36,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {21306#(= main_~p5~0 0)} assume !(0 != ~p4~0); {21306#(= main_~p5~0 0)} is VALID [2022-04-28 08:22:36,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {21306#(= main_~p5~0 0)} assume 0 != ~p5~0; {21302#false} is VALID [2022-04-28 08:22:36,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {21302#false} assume 1 != ~lk5~0; {21302#false} is VALID [2022-04-28 08:22:36,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {21302#false} assume !false; {21302#false} is VALID [2022-04-28 08:22:36,330 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-28 08:22:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180762721] [2022-04-28 08:22:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180762721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:36,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128142103] [2022-04-28 08:22:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128142103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540977901] [2022-04-28 08:22:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:36,332 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-28 08:22:36,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:36,332 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-28 08:22:36,346 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-28 08:22:36,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:36,347 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-28 08:22:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:36,714 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-28 08:22:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:36,714 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-28 08:22:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:36,714 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-28 08:22:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-28 08:22:36,716 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-28 08:22:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-28 08:22:36,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-28 08:22:36,835 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-28 08:22:36,887 INFO L225 Difference]: With dead ends: 1501 [2022-04-28 08:22:36,888 INFO L226 Difference]: Without dead ends: 875 [2022-04-28 08:22:36,889 INFO L412 NwaCegarLoop]: 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-28 08:22:36,890 INFO L413 NwaCegarLoop]: 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-28 08:22:36,890 INFO L414 NwaCegarLoop]: 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-28 08:22:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-28 08:22:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-28 08:22:36,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:36,987 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-28 08:22:36,988 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-28 08:22:36,989 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-28 08:22:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:37,025 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-28 08:22:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-28 08:22:37,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:37,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:37,028 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-28 08:22:37,029 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-28 08:22:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:37,066 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2022-04-28 08:22:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1336 transitions. [2022-04-28 08:22:37,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:37,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:37,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:37,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:37,069 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-28 08:22:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-28 08:22:37,119 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-28 08:22:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:37,119 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-28 08:22:37,119 INFO L496 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-28 08:22:37,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 873 states and 1335 transitions. [2022-04-28 08:22:38,380 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-28 08:22:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-28 08:22:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:22:38,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:38,381 INFO L195 NwaCegarLoop]: 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-28 08:22:38,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:22:38,382 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-28 08:22:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397255186] [2022-04-28 08:22:38,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 2 times [2022-04-28 08:22:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:38,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645447575] [2022-04-28 08:22:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:38,415 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-28 08:22:38,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-28 08:22:38,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-28 08:22:38,416 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-28 08:22:38,416 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-28 08:22:38,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {27811#true} assume true; {27811#true} is VALID [2022-04-28 08:22:38,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27811#true} {27811#true} #183#return; {27811#true} is VALID [2022-04-28 08:22:38,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {27811#true} call #t~ret14 := main(); {27811#true} is VALID [2022-04-28 08:22:38,416 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-28 08:22:38,417 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-28 08:22:38,417 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-28 08:22:38,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {27811#true} assume !(0 != ~p1~0); {27811#true} is VALID [2022-04-28 08:22:38,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {27811#true} assume !(0 != ~p2~0); {27811#true} is VALID [2022-04-28 08:22:38,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {27811#true} assume !(0 != ~p3~0); {27811#true} is VALID [2022-04-28 08:22:38,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {27811#true} assume !(0 != ~p4~0); {27811#true} is VALID [2022-04-28 08:22:38,417 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-28 08:22:38,418 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-28 08:22:38,418 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-28 08:22:38,418 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-28 08:22:38,419 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-28 08:22:38,419 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-28 08:22:38,420 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-28 08:22:38,420 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-28 08:22:38,420 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-28 08:22:38,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {27812#false} is VALID [2022-04-28 08:22:38,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {27812#false} assume 0 != ~p6~0; {27812#false} is VALID [2022-04-28 08:22:38,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {27812#false} assume 1 != ~lk6~0; {27812#false} is VALID [2022-04-28 08:22:38,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {27812#false} assume !false; {27812#false} is VALID [2022-04-28 08:22:38,421 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-28 08:22:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645447575] [2022-04-28 08:22:38,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645447575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:38,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:38,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:38,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397255186] [2022-04-28 08:22:38,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397255186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:38,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319423708] [2022-04-28 08:22:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:38,423 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-28 08:22:38,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:38,423 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-28 08:22:38,439 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-28 08:22:38,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:38,440 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-28 08:22:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:38,780 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-28 08:22:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:38,780 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-28 08:22:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:38,781 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-28 08:22:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-28 08:22:38,782 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-28 08:22:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-28 08:22:38,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-28 08:22:38,902 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-28 08:22:38,952 INFO L225 Difference]: With dead ends: 1309 [2022-04-28 08:22:38,952 INFO L226 Difference]: Without dead ends: 891 [2022-04-28 08:22:38,953 INFO L412 NwaCegarLoop]: 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-28 08:22:38,954 INFO L413 NwaCegarLoop]: 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-28 08:22:38,954 INFO L414 NwaCegarLoop]: 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-28 08:22:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-28 08:22:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-28 08:22:39,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:39,033 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-28 08:22:39,034 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-28 08:22:39,035 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-28 08:22:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:39,072 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-28 08:22:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-28 08:22:39,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:39,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:39,075 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-28 08:22:39,076 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-28 08:22:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:39,111 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2022-04-28 08:22:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2022-04-28 08:22:39,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:39,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:39,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:39,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:39,113 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-28 08:22:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-28 08:22:39,166 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-28 08:22:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:39,166 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-28 08:22:39,166 INFO L496 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-28 08:22:39,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 889 states and 1335 transitions. [2022-04-28 08:22:40,414 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-28 08:22:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-28 08:22:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:22:40,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:40,416 INFO L195 NwaCegarLoop]: 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-28 08:22:40,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:22:40,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-28 08:22:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418466655] [2022-04-28 08:22:40,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 2 times [2022-04-28 08:22:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877255797] [2022-04-28 08:22:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:40,459 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-28 08:22:40,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 08:22:40,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-28 08:22:40,461 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-28 08:22:40,461 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-28 08:22:40,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {34001#true} assume true; {34001#true} is VALID [2022-04-28 08:22:40,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34001#true} {34001#true} #183#return; {34001#true} is VALID [2022-04-28 08:22:40,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {34001#true} call #t~ret14 := main(); {34001#true} is VALID [2022-04-28 08:22:40,461 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-28 08:22:40,462 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-28 08:22:40,462 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-28 08:22:40,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {34001#true} assume !(0 != ~p1~0); {34001#true} is VALID [2022-04-28 08:22:40,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {34001#true} assume !(0 != ~p2~0); {34001#true} is VALID [2022-04-28 08:22:40,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {34001#true} assume !(0 != ~p3~0); {34001#true} is VALID [2022-04-28 08:22:40,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {34001#true} assume !(0 != ~p4~0); {34001#true} is VALID [2022-04-28 08:22:40,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {34001#true} assume !(0 != ~p5~0); {34001#true} is VALID [2022-04-28 08:22:40,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {34001#true} assume 0 != ~p6~0;~lk6~0 := 1; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,464 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-28 08:22:40,465 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-28 08:22:40,465 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-28 08:22:40,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {34006#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {34006#(= main_~lk6~0 1)} assume 0 != ~p6~0; {34006#(= main_~lk6~0 1)} is VALID [2022-04-28 08:22:40,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {34006#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {34002#false} is VALID [2022-04-28 08:22:40,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {34002#false} assume !false; {34002#false} is VALID [2022-04-28 08:22:40,468 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-28 08:22:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877255797] [2022-04-28 08:22:40,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877255797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:40,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:40,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:40,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:40,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418466655] [2022-04-28 08:22:40,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418466655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:40,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:40,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183314867] [2022-04-28 08:22:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:40,469 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-28 08:22:40,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:40,470 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-28 08:22:40,484 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-28 08:22:40,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:40,485 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-28 08:22:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:40,796 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-28 08:22:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:40,797 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-28 08:22:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:40,797 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-28 08:22:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 08:22:40,798 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-28 08:22:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 08:22:40,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 08:22:40,862 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-28 08:22:40,980 INFO L225 Difference]: With dead ends: 1549 [2022-04-28 08:22:40,980 INFO L226 Difference]: Without dead ends: 1547 [2022-04-28 08:22:40,980 INFO L412 NwaCegarLoop]: 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-28 08:22:40,981 INFO L413 NwaCegarLoop]: 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-28 08:22:40,981 INFO L414 NwaCegarLoop]: 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-28 08:22:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-28 08:22:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-28 08:22:41,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:41,096 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-28 08:22:41,097 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-28 08:22:41,098 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-28 08:22:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:41,196 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-28 08:22:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-28 08:22:41,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:41,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:41,201 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-28 08:22:41,202 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-28 08:22:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:41,307 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2022-04-28 08:22:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2328 transitions. [2022-04-28 08:22:41,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:41,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:41,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:41,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:41,311 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-28 08:22:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-28 08:22:41,423 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-28 08:22:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:41,423 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-28 08:22:41,423 INFO L496 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-28 08:22:41,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1289 states and 1879 transitions. [2022-04-28 08:22:43,223 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-28 08:22:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-28 08:22:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:22:43,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:43,225 INFO L195 NwaCegarLoop]: 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-28 08:22:43,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:22:43,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-28 08:22:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:43,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326079415] [2022-04-28 08:22:43,226 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 2 times [2022-04-28 08:22:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:43,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361890565] [2022-04-28 08:22:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:43,261 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-28 08:22:43,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-28 08:22:43,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-28 08:22:43,262 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-28 08:22:43,262 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-28 08:22:43,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {42783#true} assume true; {42783#true} is VALID [2022-04-28 08:22:43,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42783#true} {42783#true} #183#return; {42783#true} is VALID [2022-04-28 08:22:43,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {42783#true} call #t~ret14 := main(); {42783#true} is VALID [2022-04-28 08:22:43,262 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-28 08:22:43,263 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-28 08:22:43,263 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-28 08:22:43,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {42783#true} assume !(0 != ~p1~0); {42783#true} is VALID [2022-04-28 08:22:43,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {42783#true} assume !(0 != ~p2~0); {42783#true} is VALID [2022-04-28 08:22:43,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {42783#true} assume !(0 != ~p3~0); {42783#true} is VALID [2022-04-28 08:22:43,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {42783#true} assume !(0 != ~p4~0); {42783#true} is VALID [2022-04-28 08:22:43,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {42783#true} assume !(0 != ~p5~0); {42783#true} is VALID [2022-04-28 08:22:43,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {42783#true} assume !(0 != ~p6~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,264 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-28 08:22:43,264 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-28 08:22:43,265 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-28 08:22:43,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p1~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p2~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p3~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p4~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {42788#(= main_~p6~0 0)} assume !(0 != ~p5~0); {42788#(= main_~p6~0 0)} is VALID [2022-04-28 08:22:43,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {42788#(= main_~p6~0 0)} assume 0 != ~p6~0; {42784#false} is VALID [2022-04-28 08:22:43,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {42784#false} assume 1 != ~lk6~0; {42784#false} is VALID [2022-04-28 08:22:43,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {42784#false} assume !false; {42784#false} is VALID [2022-04-28 08:22:43,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-28 08:22:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:43,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361890565] [2022-04-28 08:22:43,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361890565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:43,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:43,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:43,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:43,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326079415] [2022-04-28 08:22:43,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326079415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:43,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:43,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804775262] [2022-04-28 08:22:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:43,269 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-28 08:22:43,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:43,269 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-28 08:22:43,283 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-28 08:22:43,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:43,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:43,284 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-28 08:22:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:43,886 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-28 08:22:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:43,886 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-28 08:22:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:43,886 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-28 08:22:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:22:43,887 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-28 08:22:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 08:22:43,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 08:22:43,983 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-28 08:22:44,104 INFO L225 Difference]: With dead ends: 2957 [2022-04-28 08:22:44,104 INFO L226 Difference]: Without dead ends: 1707 [2022-04-28 08:22:44,105 INFO L412 NwaCegarLoop]: 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-28 08:22:44,106 INFO L413 NwaCegarLoop]: 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-28 08:22:44,106 INFO L414 NwaCegarLoop]: 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-28 08:22:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-28 08:22:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-28 08:22:44,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:44,276 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-28 08:22:44,278 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-28 08:22:44,280 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-28 08:22:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:44,404 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-28 08:22:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-28 08:22:44,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:44,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:44,409 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-28 08:22:44,411 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-28 08:22:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:44,505 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2022-04-28 08:22:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2440 transitions. [2022-04-28 08:22:44,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:44,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:44,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:44,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:44,509 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-28 08:22:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-28 08:22:44,632 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-28 08:22:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:44,632 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-28 08:22:44,632 INFO L496 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-28 08:22:44,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1705 states and 2439 transitions. [2022-04-28 08:22:47,016 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-28 08:22:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-28 08:22:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:22:47,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:47,017 INFO L195 NwaCegarLoop]: 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-28 08:22:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:22:47,017 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-28 08:22:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126863361] [2022-04-28 08:22:47,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 2 times [2022-04-28 08:22:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:47,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015864618] [2022-04-28 08:22:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:47,071 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-28 08:22:47,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-28 08:22:47,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-28 08:22:47,072 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-28 08:22:47,072 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-28 08:22:47,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {55533#true} assume true; {55533#true} is VALID [2022-04-28 08:22:47,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55533#true} {55533#true} #183#return; {55533#true} is VALID [2022-04-28 08:22:47,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {55533#true} call #t~ret14 := main(); {55533#true} is VALID [2022-04-28 08:22:47,073 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-28 08:22:47,073 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-28 08:22:47,073 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-28 08:22:47,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {55533#true} assume !(0 != ~p1~0); {55533#true} is VALID [2022-04-28 08:22:47,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {55533#true} assume !(0 != ~p2~0); {55533#true} is VALID [2022-04-28 08:22:47,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {55533#true} assume !(0 != ~p3~0); {55533#true} is VALID [2022-04-28 08:22:47,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {55533#true} assume !(0 != ~p4~0); {55533#true} is VALID [2022-04-28 08:22:47,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {55533#true} assume !(0 != ~p5~0); {55533#true} is VALID [2022-04-28 08:22:47,074 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-28 08:22:47,074 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-28 08:22:47,075 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-28 08:22:47,075 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-28 08:22:47,075 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-28 08:22:47,076 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-28 08:22:47,076 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-28 08:22:47,076 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-28 08:22:47,077 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-28 08:22:47,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {55538#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {55534#false} is VALID [2022-04-28 08:22:47,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {55534#false} assume 0 != ~p7~0; {55534#false} is VALID [2022-04-28 08:22:47,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {55534#false} assume 1 != ~lk7~0; {55534#false} is VALID [2022-04-28 08:22:47,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {55534#false} assume !false; {55534#false} is VALID [2022-04-28 08:22:47,078 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-28 08:22:47,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015864618] [2022-04-28 08:22:47,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015864618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:47,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:47,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:47,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126863361] [2022-04-28 08:22:47,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126863361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:47,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:47,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071081273] [2022-04-28 08:22:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:47,079 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-28 08:22:47,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:47,079 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-28 08:22:47,096 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-28 08:22:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:47,097 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-28 08:22:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:47,627 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-28 08:22:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:47,627 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-28 08:22:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:47,627 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-28 08:22:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 08:22:47,628 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-28 08:22:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 08:22:47,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-28 08:22:47,722 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-28 08:22:47,850 INFO L225 Difference]: With dead ends: 2557 [2022-04-28 08:22:47,850 INFO L226 Difference]: Without dead ends: 1739 [2022-04-28 08:22:47,852 INFO L412 NwaCegarLoop]: 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-28 08:22:47,853 INFO L413 NwaCegarLoop]: 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-28 08:22:47,854 INFO L414 NwaCegarLoop]: 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-28 08:22:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-28 08:22:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-28 08:22:48,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:48,008 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-28 08:22:48,010 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-28 08:22:48,012 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-28 08:22:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:48,118 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 08:22:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 08:22:48,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:48,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:48,122 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-28 08:22:48,123 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-28 08:22:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:48,213 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-28 08:22:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-28 08:22:48,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:48,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:48,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:48,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:48,217 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-28 08:22:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-28 08:22:48,431 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-28 08:22:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:48,431 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-28 08:22:48,431 INFO L496 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-28 08:22:48,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1737 states and 2439 transitions. [2022-04-28 08:22:50,982 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-28 08:22:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-28 08:22:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:22:50,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:50,984 INFO L195 NwaCegarLoop]: 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-28 08:22:50,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:22:50,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-28 08:22:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:50,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559740333] [2022-04-28 08:22:50,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 2 times [2022-04-28 08:22:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:50,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114442485] [2022-04-28 08:22:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:51,017 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-28 08:22:51,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-28 08:22:51,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-28 08:22:51,018 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-28 08:22:51,018 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-28 08:22:51,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {67611#true} assume true; {67611#true} is VALID [2022-04-28 08:22:51,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67611#true} {67611#true} #183#return; {67611#true} is VALID [2022-04-28 08:22:51,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {67611#true} call #t~ret14 := main(); {67611#true} is VALID [2022-04-28 08:22:51,019 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-28 08:22:51,019 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-28 08:22:51,019 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-28 08:22:51,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {67611#true} assume !(0 != ~p1~0); {67611#true} is VALID [2022-04-28 08:22:51,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {67611#true} assume !(0 != ~p2~0); {67611#true} is VALID [2022-04-28 08:22:51,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {67611#true} assume !(0 != ~p3~0); {67611#true} is VALID [2022-04-28 08:22:51,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {67611#true} assume !(0 != ~p4~0); {67611#true} is VALID [2022-04-28 08:22:51,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {67611#true} assume !(0 != ~p5~0); {67611#true} is VALID [2022-04-28 08:22:51,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {67611#true} assume !(0 != ~p6~0); {67611#true} is VALID [2022-04-28 08:22:51,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {67611#true} assume 0 != ~p7~0;~lk7~0 := 1; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,021 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-28 08:22:51,022 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-28 08:22:51,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {67616#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {67616#(= main_~lk7~0 1)} assume 0 != ~p7~0; {67616#(= main_~lk7~0 1)} is VALID [2022-04-28 08:22:51,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {67616#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {67612#false} is VALID [2022-04-28 08:22:51,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {67612#false} assume !false; {67612#false} is VALID [2022-04-28 08:22:51,024 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-28 08:22:51,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114442485] [2022-04-28 08:22:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114442485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:51,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:51,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:51,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559740333] [2022-04-28 08:22:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559740333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:51,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:51,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685427137] [2022-04-28 08:22:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:51,026 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-28 08:22:51,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:51,026 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-28 08:22:51,041 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-28 08:22:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:51,042 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-28 08:22:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:51,708 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-28 08:22:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:51,708 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-28 08:22:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:51,708 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-28 08:22:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 08:22:51,709 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-28 08:22:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 08:22:51,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 08:22:51,770 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-28 08:22:52,136 INFO L225 Difference]: With dead ends: 2957 [2022-04-28 08:22:52,136 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 08:22:52,137 INFO L412 NwaCegarLoop]: 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-28 08:22:52,137 INFO L413 NwaCegarLoop]: 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-28 08:22:52,137 INFO L414 NwaCegarLoop]: 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-28 08:22:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 08:22:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-28 08:22:52,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:52,415 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-28 08:22:52,418 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-28 08:22:52,421 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-28 08:22:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:52,736 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 08:22:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 08:22:52,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:52,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:52,743 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-28 08:22:52,746 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-28 08:22:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:53,068 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-28 08:22:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-28 08:22:53,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:53,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:53,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:53,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:53,073 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-28 08:22:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-28 08:22:53,355 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-28 08:22:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:53,355 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-28 08:22:53,356 INFO L496 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-28 08:22:53,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2569 states and 3495 transitions. [2022-04-28 08:22:56,786 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-28 08:22:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-28 08:22:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:22:56,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:56,788 INFO L195 NwaCegarLoop]: 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-28 08:22:56,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:22:56,789 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-28 08:22:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:56,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039178] [2022-04-28 08:22:56,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 2 times [2022-04-28 08:22:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:56,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843436012] [2022-04-28 08:22:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:56,825 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-28 08:22:56,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-28 08:22:56,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-28 08:22:56,825 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-28 08:22:56,826 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-28 08:22:56,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {84585#true} assume true; {84585#true} is VALID [2022-04-28 08:22:56,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84585#true} {84585#true} #183#return; {84585#true} is VALID [2022-04-28 08:22:56,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {84585#true} call #t~ret14 := main(); {84585#true} is VALID [2022-04-28 08:22:56,826 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-28 08:22:56,826 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-28 08:22:56,826 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-28 08:22:56,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {84585#true} assume !(0 != ~p1~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {84585#true} assume !(0 != ~p2~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {84585#true} assume !(0 != ~p3~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {84585#true} assume !(0 != ~p4~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {84585#true} assume !(0 != ~p5~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {84585#true} assume !(0 != ~p6~0); {84585#true} is VALID [2022-04-28 08:22:56,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {84585#true} assume !(0 != ~p7~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,828 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-28 08:22:56,828 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-28 08:22:56,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p1~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p2~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p3~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p4~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p5~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {84590#(= main_~p7~0 0)} assume !(0 != ~p6~0); {84590#(= main_~p7~0 0)} is VALID [2022-04-28 08:22:56,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {84590#(= main_~p7~0 0)} assume 0 != ~p7~0; {84586#false} is VALID [2022-04-28 08:22:56,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {84586#false} assume 1 != ~lk7~0; {84586#false} is VALID [2022-04-28 08:22:56,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {84586#false} assume !false; {84586#false} is VALID [2022-04-28 08:22:56,831 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-28 08:22:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:56,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843436012] [2022-04-28 08:22:56,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843436012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:56,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:56,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:56,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039178] [2022-04-28 08:22:56,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:56,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:56,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:56,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136184339] [2022-04-28 08:22:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:56,834 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-28 08:22:56,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:56,834 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-28 08:22:56,849 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-28 08:22:56,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:56,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:56,850 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-28 08:22:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:58,582 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-28 08:22:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:58,583 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-28 08:22:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:58,583 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-28 08:22:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 08:22:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 08:22:58,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 08:22:58,675 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-28 08:22:59,150 INFO L225 Difference]: With dead ends: 5837 [2022-04-28 08:22:59,150 INFO L226 Difference]: Without dead ends: 3339 [2022-04-28 08:22:59,154 INFO L412 NwaCegarLoop]: 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-28 08:22:59,155 INFO L413 NwaCegarLoop]: 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-28 08:22:59,155 INFO L414 NwaCegarLoop]: 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-28 08:22:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-28 08:22:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-28 08:22:59,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:59,413 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-28 08:22:59,414 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-28 08:22:59,416 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-28 08:22:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:59,720 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 08:22:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 08:22:59,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:59,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:59,726 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-28 08:22:59,728 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-28 08:23:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:00,056 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-28 08:23:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-28 08:23:00,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:00,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:00,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:00,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:00,063 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-28 08:23:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-28 08:23:00,610 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-28 08:23:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:00,610 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-28 08:23:00,611 INFO L496 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-28 08:23:00,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 4423 transitions. [2022-04-28 08:23:05,033 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-28 08:23:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-28 08:23:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:23:05,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:05,036 INFO L195 NwaCegarLoop]: 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-28 08:23:05,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:23:05,036 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-28 08:23:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:05,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305223784] [2022-04-28 08:23:05,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 2 times [2022-04-28 08:23:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:05,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663978820] [2022-04-28 08:23:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:05,069 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-28 08:23:05,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-28 08:23:05,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-28 08:23:05,071 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-28 08:23:05,071 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-28 08:23:05,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {109623#true} assume true; {109623#true} is VALID [2022-04-28 08:23:05,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109623#true} {109623#true} #183#return; {109623#true} is VALID [2022-04-28 08:23:05,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {109623#true} call #t~ret14 := main(); {109623#true} is VALID [2022-04-28 08:23:05,071 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-28 08:23:05,071 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-28 08:23:05,072 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-28 08:23:05,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {109623#true} assume !(0 != ~p1~0); {109623#true} is VALID [2022-04-28 08:23:05,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {109623#true} assume !(0 != ~p2~0); {109623#true} is VALID [2022-04-28 08:23:05,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {109623#true} assume !(0 != ~p3~0); {109623#true} is VALID [2022-04-28 08:23:05,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {109623#true} assume !(0 != ~p4~0); {109623#true} is VALID [2022-04-28 08:23:05,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {109623#true} assume !(0 != ~p5~0); {109623#true} is VALID [2022-04-28 08:23:05,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {109623#true} assume !(0 != ~p6~0); {109623#true} is VALID [2022-04-28 08:23:05,073 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-28 08:23:05,073 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-28 08:23:05,073 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-28 08:23:05,074 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-28 08:23:05,074 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-28 08:23:05,074 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-28 08:23:05,075 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-28 08:23:05,075 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-28 08:23:05,075 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-28 08:23:05,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {109628#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {109624#false} is VALID [2022-04-28 08:23:05,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {109624#false} assume 0 != ~p8~0; {109624#false} is VALID [2022-04-28 08:23:05,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {109624#false} assume 1 != ~lk8~0; {109624#false} is VALID [2022-04-28 08:23:05,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {109624#false} assume !false; {109624#false} is VALID [2022-04-28 08:23:05,076 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-28 08:23:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:05,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663978820] [2022-04-28 08:23:05,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663978820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:05,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:05,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:05,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:05,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305223784] [2022-04-28 08:23:05,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305223784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:05,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:05,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023162360] [2022-04-28 08:23:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:05,078 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-28 08:23:05,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:05,078 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-28 08:23:05,094 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-28 08:23:05,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:05,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:05,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:05,095 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-28 08:23:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:06,445 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-28 08:23:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:06,446 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-28 08:23:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:06,446 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-28 08:23:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:23:06,447 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-28 08:23:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:23:06,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 08:23:06,539 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-28 08:23:07,052 INFO L225 Difference]: With dead ends: 5005 [2022-04-28 08:23:07,052 INFO L226 Difference]: Without dead ends: 3403 [2022-04-28 08:23:07,054 INFO L412 NwaCegarLoop]: 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-28 08:23:07,054 INFO L413 NwaCegarLoop]: 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-28 08:23:07,055 INFO L414 NwaCegarLoop]: 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-28 08:23:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-28 08:23:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-28 08:23:07,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:07,354 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-28 08:23:07,356 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-28 08:23:07,358 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-28 08:23:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:07,664 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 08:23:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 08:23:07,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:07,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:07,670 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-28 08:23:07,672 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-28 08:23:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:08,005 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-28 08:23:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-28 08:23:08,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:08,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:08,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:08,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:08,012 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-28 08:23:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-28 08:23:08,535 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-28 08:23:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:08,535 INFO L495 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-28 08:23:08,535 INFO L496 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-28 08:23:08,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3401 states and 4423 transitions. [2022-04-28 08:23:12,948 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-28 08:23:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-28 08:23:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:23:12,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:12,951 INFO L195 NwaCegarLoop]: 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-28 08:23:12,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:23:12,951 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-28 08:23:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475943032] [2022-04-28 08:23:12,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 2 times [2022-04-28 08:23:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015221001] [2022-04-28 08:23:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:12,986 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-28 08:23:12,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-28 08:23:12,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-28 08:23:12,987 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-28 08:23:12,987 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-28 08:23:12,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {133253#true} assume true; {133253#true} is VALID [2022-04-28 08:23:12,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133253#true} {133253#true} #183#return; {133253#true} is VALID [2022-04-28 08:23:12,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {133253#true} call #t~ret14 := main(); {133253#true} is VALID [2022-04-28 08:23:12,987 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-28 08:23:12,987 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-28 08:23:12,988 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-28 08:23:12,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {133253#true} assume !(0 != ~p1~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {133253#true} assume !(0 != ~p2~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {133253#true} assume !(0 != ~p3~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {133253#true} assume !(0 != ~p4~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {133253#true} assume !(0 != ~p5~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {133253#true} assume !(0 != ~p6~0); {133253#true} is VALID [2022-04-28 08:23:12,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {133253#true} assume !(0 != ~p7~0); {133253#true} is VALID [2022-04-28 08:23:12,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {133253#true} assume 0 != ~p8~0;~lk8~0 := 1; {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,989 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-28 08:23:12,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {133258#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {133258#(= main_~lk8~0 1)} assume 0 != ~p8~0; {133258#(= main_~lk8~0 1)} is VALID [2022-04-28 08:23:12,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {133258#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {133254#false} is VALID [2022-04-28 08:23:12,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {133254#false} assume !false; {133254#false} is VALID [2022-04-28 08:23:12,992 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-28 08:23:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015221001] [2022-04-28 08:23:12,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015221001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:12,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:12,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475943032] [2022-04-28 08:23:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475943032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291659732] [2022-04-28 08:23:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:12,993 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-28 08:23:12,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:12,994 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-28 08:23:13,010 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-28 08:23:13,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:13,010 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-28 08:23:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:14,881 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-28 08:23:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:14,881 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-28 08:23:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:14,881 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-28 08:23:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:23:14,883 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-28 08:23:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:23:14,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 08:23:14,945 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-28 08:23:16,191 INFO L225 Difference]: With dead ends: 5645 [2022-04-28 08:23:16,191 INFO L226 Difference]: Without dead ends: 5643 [2022-04-28 08:23:16,192 INFO L412 NwaCegarLoop]: 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-28 08:23:16,192 INFO L413 NwaCegarLoop]: 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-28 08:23:16,193 INFO L414 NwaCegarLoop]: 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-28 08:23:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-28 08:23:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-28 08:23:16,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:16,626 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-28 08:23:16,630 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-28 08:23:16,633 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-28 08:23:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:17,435 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 08:23:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 08:23:17,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:17,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:17,449 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-28 08:23:17,454 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-28 08:23:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:18,270 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-28 08:23:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-28 08:23:18,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:18,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:18,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:18,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:18,281 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-28 08:23:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-28 08:23:19,384 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-28 08:23:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:19,384 INFO L495 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-28 08:23:19,384 INFO L496 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-28 08:23:19,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5129 states and 6471 transitions. [2022-04-28 08:23:26,044 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-28 08:23:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-28 08:23:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:23:26,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:26,049 INFO L195 NwaCegarLoop]: 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-28 08:23:26,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:23:26,049 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-28 08:23:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474933992] [2022-04-28 08:23:26,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 2 times [2022-04-28 08:23:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661008893] [2022-04-28 08:23:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:26,080 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-28 08:23:26,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-28 08:23:26,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-28 08:23:26,081 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-28 08:23:26,081 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-28 08:23:26,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {166099#true} assume true; {166099#true} is VALID [2022-04-28 08:23:26,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166099#true} {166099#true} #183#return; {166099#true} is VALID [2022-04-28 08:23:26,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {166099#true} call #t~ret14 := main(); {166099#true} is VALID [2022-04-28 08:23:26,081 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-28 08:23:26,081 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-28 08:23:26,081 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-28 08:23:26,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {166099#true} assume !(0 != ~p1~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {166099#true} assume !(0 != ~p2~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {166099#true} assume !(0 != ~p3~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {166099#true} assume !(0 != ~p4~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {166099#true} assume !(0 != ~p5~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {166099#true} assume !(0 != ~p6~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {166099#true} assume !(0 != ~p7~0); {166099#true} is VALID [2022-04-28 08:23:26,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {166099#true} assume !(0 != ~p8~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,083 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-28 08:23:26,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p1~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p2~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p3~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p4~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p5~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p6~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {166104#(= main_~p8~0 0)} assume !(0 != ~p7~0); {166104#(= main_~p8~0 0)} is VALID [2022-04-28 08:23:26,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {166104#(= main_~p8~0 0)} assume 0 != ~p8~0; {166100#false} is VALID [2022-04-28 08:23:26,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {166100#false} assume 1 != ~lk8~0; {166100#false} is VALID [2022-04-28 08:23:26,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {166100#false} assume !false; {166100#false} is VALID [2022-04-28 08:23:26,085 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-28 08:23:26,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:26,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661008893] [2022-04-28 08:23:26,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661008893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:26,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:26,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:26,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:26,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474933992] [2022-04-28 08:23:26,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474933992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:26,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:26,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769802769] [2022-04-28 08:23:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:26,087 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-28 08:23:26,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:26,087 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-28 08:23:26,103 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-28 08:23:26,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:26,104 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-28 08:23:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:32,123 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-28 08:23:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:32,123 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-28 08:23:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:32,124 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-28 08:23:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 08:23:32,125 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-28 08:23:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 08:23:32,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-28 08:23:32,222 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-28 08:23:34,097 INFO L225 Difference]: With dead ends: 11533 [2022-04-28 08:23:34,097 INFO L226 Difference]: Without dead ends: 6539 [2022-04-28 08:23:34,102 INFO L412 NwaCegarLoop]: 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-28 08:23:34,102 INFO L413 NwaCegarLoop]: 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-28 08:23:34,102 INFO L414 NwaCegarLoop]: 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-28 08:23:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-28 08:23:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-28 08:23:34,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:34,571 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-28 08:23:34,575 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-28 08:23:34,578 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-28 08:23:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:35,819 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 08:23:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 08:23:35,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:35,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:35,829 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-28 08:23:35,832 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-28 08:23:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:37,085 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-28 08:23:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-28 08:23:37,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:37,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:37,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:37,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:37,096 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-28 08:23:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-28 08:23:39,098 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-28 08:23:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:39,098 INFO L495 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-28 08:23:39,098 INFO L496 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-28 08:23:39,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6537 states and 7943 transitions. [2022-04-28 08:23:47,085 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-28 08:23:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-28 08:23:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:23:47,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:47,090 INFO L195 NwaCegarLoop]: 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-28 08:23:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:23:47,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-28 08:23:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:47,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408441300] [2022-04-28 08:23:47,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 2 times [2022-04-28 08:23:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:47,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550102294] [2022-04-28 08:23:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:47,123 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-28 08:23:47,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-28 08:23:47,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-28 08:23:47,124 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-28 08:23:47,124 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-28 08:23:47,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {215329#true} assume true; {215329#true} is VALID [2022-04-28 08:23:47,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215329#true} {215329#true} #183#return; {215329#true} is VALID [2022-04-28 08:23:47,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {215329#true} call #t~ret14 := main(); {215329#true} is VALID [2022-04-28 08:23:47,125 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-28 08:23:47,125 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-28 08:23:47,125 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-28 08:23:47,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {215329#true} assume !(0 != ~p1~0); {215329#true} is VALID [2022-04-28 08:23:47,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {215329#true} assume !(0 != ~p2~0); {215329#true} is VALID [2022-04-28 08:23:47,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {215329#true} assume !(0 != ~p3~0); {215329#true} is VALID [2022-04-28 08:23:47,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {215329#true} assume !(0 != ~p4~0); {215329#true} is VALID [2022-04-28 08:23:47,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {215329#true} assume !(0 != ~p5~0); {215329#true} is VALID [2022-04-28 08:23:47,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {215329#true} assume !(0 != ~p6~0); {215329#true} is VALID [2022-04-28 08:23:47,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {215329#true} assume !(0 != ~p7~0); {215329#true} is VALID [2022-04-28 08:23:47,126 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-28 08:23:47,126 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-28 08:23:47,126 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-28 08:23:47,127 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-28 08:23:47,127 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-28 08:23:47,127 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-28 08:23:47,128 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-28 08:23:47,128 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-28 08:23:47,128 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-28 08:23:47,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {215334#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {215330#false} is VALID [2022-04-28 08:23:47,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {215330#false} assume 0 != ~p9~0; {215330#false} is VALID [2022-04-28 08:23:47,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {215330#false} assume 1 != ~lk9~0; {215330#false} is VALID [2022-04-28 08:23:47,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {215330#false} assume !false; {215330#false} is VALID [2022-04-28 08:23:47,129 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-28 08:23:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:47,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550102294] [2022-04-28 08:23:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550102294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:47,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:47,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:47,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408441300] [2022-04-28 08:23:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408441300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:47,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:47,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:23:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843048658] [2022-04-28 08:23:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:47,131 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-28 08:23:47,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:47,131 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-28 08:23:47,147 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-28 08:23:47,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:23:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:23:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:23:47,148 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-28 08:23:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:51,701 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-28 08:23:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:51,701 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-28 08:23:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:51,701 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-28 08:23:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:23:51,702 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-28 08:23:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:23:51,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 08:23:51,795 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-28 08:23:53,741 INFO L225 Difference]: With dead ends: 9805 [2022-04-28 08:23:53,741 INFO L226 Difference]: Without dead ends: 6667 [2022-04-28 08:23:53,745 INFO L412 NwaCegarLoop]: 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-28 08:23:53,745 INFO L413 NwaCegarLoop]: 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-28 08:23:53,745 INFO L414 NwaCegarLoop]: 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-28 08:23:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-28 08:23:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-28 08:23:54,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:54,243 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-28 08:23:54,247 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-28 08:23:54,252 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-28 08:23:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:55,501 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 08:23:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 08:23:55,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:55,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:55,513 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-28 08:23:55,518 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-28 08:23:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:56,784 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-28 08:23:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-28 08:23:56,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:56,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:56,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:56,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:56,794 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-28 08:23:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-28 08:23:58,873 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-28 08:23:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:58,873 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-28 08:23:58,873 INFO L496 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-28 08:23:58,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 7943 transitions. [2022-04-28 08:24:06,850 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-28 08:24:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-28 08:24:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:24:06,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:06,854 INFO L195 NwaCegarLoop]: 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-28 08:24:06,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:24:06,855 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-28 08:24:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:06,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [858679577] [2022-04-28 08:24:06,855 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 2 times [2022-04-28 08:24:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:06,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067810197] [2022-04-28 08:24:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:06,884 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-28 08:24:06,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-28 08:24:06,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-28 08:24:06,885 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-28 08:24:06,885 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-28 08:24:06,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {261615#true} assume true; {261615#true} is VALID [2022-04-28 08:24:06,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261615#true} {261615#true} #183#return; {261615#true} is VALID [2022-04-28 08:24:06,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {261615#true} call #t~ret14 := main(); {261615#true} is VALID [2022-04-28 08:24:06,886 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-28 08:24:06,886 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-28 08:24:06,886 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-28 08:24:06,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {261615#true} assume !(0 != ~p1~0); {261615#true} is VALID [2022-04-28 08:24:06,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {261615#true} assume !(0 != ~p2~0); {261615#true} is VALID [2022-04-28 08:24:06,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {261615#true} assume !(0 != ~p3~0); {261615#true} is VALID [2022-04-28 08:24:06,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {261615#true} assume !(0 != ~p4~0); {261615#true} is VALID [2022-04-28 08:24:06,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {261615#true} assume !(0 != ~p5~0); {261615#true} is VALID [2022-04-28 08:24:06,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {261615#true} assume !(0 != ~p6~0); {261615#true} is VALID [2022-04-28 08:24:06,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {261615#true} assume !(0 != ~p7~0); {261615#true} is VALID [2022-04-28 08:24:06,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {261615#true} assume !(0 != ~p8~0); {261615#true} is VALID [2022-04-28 08:24:06,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {261615#true} assume 0 != ~p9~0;~lk9~0 := 1; {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {261620#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {261620#(= main_~lk9~0 1)} assume 0 != ~p9~0; {261620#(= main_~lk9~0 1)} is VALID [2022-04-28 08:24:06,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {261620#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {261616#false} is VALID [2022-04-28 08:24:06,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {261616#false} assume !false; {261616#false} is VALID [2022-04-28 08:24:06,890 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-28 08:24:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067810197] [2022-04-28 08:24:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067810197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:06,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:06,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:06,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [858679577] [2022-04-28 08:24:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [858679577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:06,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:06,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637334767] [2022-04-28 08:24:06,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:06,892 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-28 08:24:06,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:06,892 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-28 08:24:06,908 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-28 08:24:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:24:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:06,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:24:06,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:24:06,909 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-28 08:24:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:12,519 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-28 08:24:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:24:12,519 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-28 08:24:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:24:12,519 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-28 08:24:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 08:24:12,520 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-28 08:24:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-04-28 08:24:12,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2022-04-28 08:24:12,574 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-28 08:24:17,192 INFO L225 Difference]: With dead ends: 10763 [2022-04-28 08:24:17,192 INFO L226 Difference]: Without dead ends: 10761 [2022-04-28 08:24:17,193 INFO L412 NwaCegarLoop]: 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-28 08:24:17,194 INFO L413 NwaCegarLoop]: 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-28 08:24:17,194 INFO L414 NwaCegarLoop]: 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-28 08:24:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-28 08:24:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-28 08:24:18,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:24:18,010 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-28 08:24:18,017 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-28 08:24:18,024 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-28 08:24:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:20,872 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 08:24:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 08:24:20,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:20,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:20,893 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-28 08:24:20,901 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-28 08:24:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:23,629 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-28 08:24:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-28 08:24:23,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:23,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:23,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:24:23,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:24:23,652 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-28 08:24:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-28 08:24:28,061 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-28 08:24:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:24:28,061 INFO L495 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-28 08:24:28,061 INFO L496 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-28 08:24:28,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10249 states and 11911 transitions. [2022-04-28 08:24:40,716 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-28 08:24:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-28 08:24:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:24:40,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:40,724 INFO L195 NwaCegarLoop]: 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-28 08:24:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:24:40,724 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-28 08:24:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:40,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967674485] [2022-04-28 08:24:40,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 2 times [2022-04-28 08:24:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010987036] [2022-04-28 08:24:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:40,753 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-28 08:24:40,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-28 08:24:40,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-28 08:24:40,754 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-28 08:24:40,754 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-28 08:24:40,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {325173#true} assume true; {325173#true} is VALID [2022-04-28 08:24:40,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325173#true} {325173#true} #183#return; {325173#true} is VALID [2022-04-28 08:24:40,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {325173#true} call #t~ret14 := main(); {325173#true} is VALID [2022-04-28 08:24:40,754 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-28 08:24:40,754 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-28 08:24:40,755 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-28 08:24:40,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {325173#true} assume !(0 != ~p1~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {325173#true} assume !(0 != ~p2~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {325173#true} assume !(0 != ~p3~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {325173#true} assume !(0 != ~p4~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {325173#true} assume !(0 != ~p5~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {325173#true} assume !(0 != ~p6~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {325173#true} assume !(0 != ~p7~0); {325173#true} is VALID [2022-04-28 08:24:40,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {325173#true} assume !(0 != ~p8~0); {325173#true} is VALID [2022-04-28 08:24:40,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {325173#true} assume !(0 != ~p9~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p1~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p2~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p3~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p4~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p5~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p6~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p7~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {325178#(= main_~p9~0 0)} assume !(0 != ~p8~0); {325178#(= main_~p9~0 0)} is VALID [2022-04-28 08:24:40,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {325178#(= main_~p9~0 0)} assume 0 != ~p9~0; {325174#false} is VALID [2022-04-28 08:24:40,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {325174#false} assume 1 != ~lk9~0; {325174#false} is VALID [2022-04-28 08:24:40,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {325174#false} assume !false; {325174#false} is VALID [2022-04-28 08:24:40,759 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-28 08:24:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:40,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010987036] [2022-04-28 08:24:40,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010987036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:40,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:40,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967674485] [2022-04-28 08:24:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967674485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:40,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306159776] [2022-04-28 08:24:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:40,761 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-28 08:24:40,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:40,761 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-28 08:24:40,778 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-28 08:24:40,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:24:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:24:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:24:40,779 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-28 08:25:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:05,058 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-28 08:25:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:25:05,058 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-28 08:25:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:25:05,058 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-28 08:25:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:25:05,059 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-28 08:25:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:25:05,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 08:25:05,149 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-28 08:25:05,150 INFO L225 Difference]: With dead ends: 22793 [2022-04-28 08:25:05,150 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 08:25:05,182 INFO L412 NwaCegarLoop]: 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-28 08:25:05,183 INFO L413 NwaCegarLoop]: 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-28 08:25:05,183 INFO L414 NwaCegarLoop]: 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-28 08:25:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 08:25:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 08:25:05,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:25:05,184 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-28 08:25:05,184 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-28 08:25:05,184 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-28 08:25:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:05,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:25:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:25:05,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:05,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:25:05,184 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-28 08:25:05,184 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-28 08:25:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:05,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:25:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:25:05,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:05,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:25:05,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:25:05,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:25:05,185 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-28 08:25:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 08:25:05,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 08:25:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:25:05,185 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 08:25:05,186 INFO L496 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-28 08:25:05,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 08:25:05,186 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-28 08:25:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:25:05,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:05,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:25:05,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:25:05,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 08:25:14,874 WARN L232 SmtUtils]: Spent 7.34s 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-28 08:25:20,920 WARN L232 SmtUtils]: Spent 6.04s 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-28 08:26:10,375 WARN L232 SmtUtils]: Spent 36.95s 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-28 08:26:56,731 WARN L232 SmtUtils]: Spent 38.73s 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-28 08:27:01,836 WARN L232 SmtUtils]: Spent 5.10s 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-28 08:27:20,341 WARN L232 SmtUtils]: Spent 8.74s 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-28 08:27:35,494 WARN L232 SmtUtils]: Spent 15.15s 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-28 08:28:04,268 WARN L232 SmtUtils]: Spent 28.77s 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-28 08:28:20,424 WARN L232 SmtUtils]: Spent 12.42s 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-28 08:28:34,365 WARN L232 SmtUtils]: Spent 6.34s 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-28 08:28:44,883 WARN L232 SmtUtils]: Spent 6.42s 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-28 08:29:03,031 WARN L232 SmtUtils]: Spent 18.15s 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-28 08:29:26,270 WARN L232 SmtUtils]: Spent 23.24s 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-28 08:29:36,104 WARN L232 SmtUtils]: Spent 9.83s 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-28 08:29:41,855 WARN L232 SmtUtils]: Spent 5.74s 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-28 08:29:52,197 WARN L232 SmtUtils]: Spent 10.32s 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-28 08:30:05,071 WARN L232 SmtUtils]: Spent 12.85s 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-28 08:30:17,575 WARN L232 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 582 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:23,360 WARN L232 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 548 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:32,345 WARN L232 SmtUtils]: Spent 8.96s on a formula simplification. DAG size of input: 616 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:38,327 WARN L232 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 554 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:46,235 WARN L232 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 543 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:52,616 WARN L232 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 564 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:30:59,042 WARN L232 SmtUtils]: Spent 6.41s 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-28 08:31:05,559 WARN L232 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 642 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:31:16,787 WARN L232 SmtUtils]: Spent 11.22s 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-28 08:31:32,050 WARN L232 SmtUtils]: Spent 12.75s 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-28 08:31:39,036 WARN L232 SmtUtils]: Spent 6.97s 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-28 08:32:17,198 WARN L232 SmtUtils]: Spent 36.03s 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-28 08:32:34,748 WARN L232 SmtUtils]: Spent 17.53s 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-28 08:32:51,314 WARN L232 SmtUtils]: Spent 16.55s 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-28 08:33:01,304 WARN L232 SmtUtils]: Spent 6.65s 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-28 08:33:09,172 WARN L232 SmtUtils]: Spent 7.86s 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-28 08:33:17,261 WARN L232 SmtUtils]: Spent 8.08s 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-28 08:33:17,276 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 08:33:17,276 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 08:33:17,276 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L895 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-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:33:17,276 INFO L895 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-28 08:33:17,277 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 151) the Hoare annotation is: true [2022-04-28 08:33:17,279 INFO L895 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-28 08:33:17,279 INFO L895 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-28 08:33:17,279 INFO L895 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-28 08:33:17,279 INFO L895 garLoopResultBuilder]: At program point L136-1(lines 38 146) the Hoare annotation is: (or (= main_~p9~0 0) (= main_~lk9~0 1)) [2022-04-28 08:33:17,282 INFO L895 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-28 08:33:17,282 INFO L895 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-28 08:33:17,283 INFO L895 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-28 08:33:17,283 INFO L895 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-28 08:33:17,283 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 151) the Hoare annotation is: true [2022-04-28 08:33:17,283 INFO L895 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-28 08:33:17,283 INFO L895 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-28 08:33:17,283 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) the Hoare annotation is: false [2022-04-28 08:33:17,284 INFO L902 garLoopResultBuilder]: At program point L63(lines 63 65) the Hoare annotation is: true [2022-04-28 08:33:17,284 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-28 08:33:17,284 INFO L895 garLoopResultBuilder]: At program point L63-2(lines 38 146) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 08:33:17,284 INFO L895 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-28 08:33:17,284 INFO L895 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-28 08:33:17,284 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-28 08:33:17,285 INFO L895 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-28 08:33:17,285 INFO L902 garLoopResultBuilder]: At program point L40(lines 40 42) the Hoare annotation is: true [2022-04-28 08:33:17,285 INFO L895 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-28 08:33:17,286 INFO L895 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-28 08:33:17,286 INFO L895 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-28 08:33:17,287 INFO L895 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-28 08:33:17,287 INFO L895 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-28 08:33:17,288 INFO L895 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-28 08:33:17,288 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-28 08:33:17,288 INFO L895 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-28 08:33:17,288 INFO L895 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-28 08:33:17,288 INFO L895 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-28 08:33:17,288 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (= main_~lk9~0 1) [2022-04-28 08:33:17,288 INFO L895 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-28 08:33:17,289 INFO L895 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-28 08:33:17,292 INFO L356 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-28 08:33:17,294 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:33:17,296 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:33:17,297 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:33:17,614 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-28 08:33:17,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:33:17 BoogieIcfgContainer [2022-04-28 08:33:17,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:33:17,621 INFO L158 Benchmark]: Toolchain (without parser) took 652910.64ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.5MB in the beginning and 631.9MB in the end (delta: -508.4MB). Peak memory consumption was 931.0MB. Max. memory is 8.0GB. [2022-04-28 08:33:17,621 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:33:17,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.92ms. Allocated memory is still 172.0MB. Free memory was 123.2MB in the beginning and 147.0MB in the end (delta: -23.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-28 08:33:17,622 INFO L158 Benchmark]: Boogie Preprocessor took 40.02ms. Allocated memory is still 172.0MB. Free memory was 147.0MB in the beginning and 145.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:33:17,622 INFO L158 Benchmark]: RCFGBuilder took 446.12ms. Allocated memory is still 172.0MB. Free memory was 145.3MB in the beginning and 131.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 08:33:17,623 INFO L158 Benchmark]: TraceAbstraction took 652098.67ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 131.0MB in the beginning and 631.9MB in the end (delta: -500.9MB). Peak memory consumption was 938.5MB. Max. memory is 8.0GB. [2022-04-28 08:33:17,623 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.11ms. Allocated memory is still 172.0MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.92ms. Allocated memory is still 172.0MB. Free memory was 123.2MB in the beginning and 147.0MB in the end (delta: -23.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.02ms. Allocated memory is still 172.0MB. Free memory was 147.0MB in the beginning and 145.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 446.12ms. Allocated memory is still 172.0MB. Free memory was 145.3MB in the beginning and 131.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 652098.67ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 131.0MB in the beginning and 631.9MB in the end (delta: -500.9MB). Peak memory consumption was 938.5MB. 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: 651.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 492.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2859 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2859 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 0.9s 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.3s 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: 31.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 12851 NumberOfFragments, 51244 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 270.9s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2169939 FormulaSimplificationTreeSizeReductionInter, 220.9s 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-28 08:33:17,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...