/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:21:07,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:21:07,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:21:07,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:21:07,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:21:07,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:21:07,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:21:07,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:21:07,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:21:07,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:21:07,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:21:07,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:21:07,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:21:07,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:21:07,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:21:07,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:21:07,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:21:07,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:21:07,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:21:07,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:21:07,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:21:07,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:21:07,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:21:07,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:21:07,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:21:07,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:21:07,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:21:07,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:21:07,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:21:07,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:21:07,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:21:07,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:21:07,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:21:07,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:21:07,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:21:07,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:21:07,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:21:07,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:21:07,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:21:07,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:21:07,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:21:07,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:21:07,191 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:21:07,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:21:07,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:21:07,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:21:07,201 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:21:07,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:21:07,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:21:07,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:21:07,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:21:07,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:21:07,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:21:07,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:21:07,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:21:07,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:21:07,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:21:07,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:21:07,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:21:07,204 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:21:07,204 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:21:07,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:21:07,204 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:21:07,204 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:21:07,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:21:07,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:21:07,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:21:07,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:21:07,445 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:21:07,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 08:21:07,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c421ae3b/689133e0c70f43dd9a2d6e69dc3fff89/FLAGf7444d99f [2022-04-28 08:21:07,791 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:21:07,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 08:21:07,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c421ae3b/689133e0c70f43dd9a2d6e69dc3fff89/FLAGf7444d99f [2022-04-28 08:21:08,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c421ae3b/689133e0c70f43dd9a2d6e69dc3fff89 [2022-04-28 08:21:08,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:21:08,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:21:08,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:21:08,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:21:08,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:21:08,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c70c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08, skipping insertion in model container [2022-04-28 08:21:08,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:21:08,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:21:08,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-28 08:21:08,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:21:08,413 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:21:08,430 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_8.c[3218,3231] [2022-04-28 08:21:08,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:21:08,439 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:21:08,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08 WrapperNode [2022-04-28 08:21:08,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:21:08,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:21:08,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:21:08,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:21:08,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:21:08,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:21:08,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:21:08,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:21:08,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (1/1) ... [2022-04-28 08:21:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:21:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:21:08,488 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:21:08,504 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:21:08,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:21:08,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:21:08,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:21:08,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:21:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:21:08,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:21:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:21:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:21:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:21:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:21:08,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:21:08,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:21:08,873 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:21:08,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:21:08,878 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:21:08,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:21:08 BoogieIcfgContainer [2022-04-28 08:21:08,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:21:08,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:21:08,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:21:08,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:21:08,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:21:08" (1/3) ... [2022-04-28 08:21:08,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a9bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:21:08, skipping insertion in model container [2022-04-28 08:21:08,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:21:08" (2/3) ... [2022-04-28 08:21:08,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549a9bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:21:08, skipping insertion in model container [2022-04-28 08:21:08,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:21:08" (3/3) ... [2022-04-28 08:21:08,895 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-28 08:21:08,907 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:21:08,908 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:21:08,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:21:08,969 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@1ae83255, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d35ebde [2022-04-28 08:21:08,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:21:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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:21:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:21:08,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:08,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:21:08,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-28 08:21:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:09,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345946156] [2022-04-28 08:21:09,011 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-04-28 08:21:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:09,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488699012] [2022-04-28 08:21:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:09,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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); {42#true} is VALID [2022-04-28 08:21:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 08:21:09,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-28 08:21:09,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:09,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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); {42#true} is VALID [2022-04-28 08:21:09,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 08:21:09,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-28 08:21:09,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-28 08:21:09,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#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;havoc ~cond~0; {42#true} is VALID [2022-04-28 08:21:09,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {42#true} is VALID [2022-04-28 08:21:09,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#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; {42#true} is VALID [2022-04-28 08:21:09,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 08:21:09,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-28 08:21:09,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 08:21:09,269 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:21:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488699012] [2022-04-28 08:21:09,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488699012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:09,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:09,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:09,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345946156] [2022-04-28 08:21:09,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345946156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:09,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:09,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387658000] [2022-04-28 08:21:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:09,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-28 08:21:09,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:09,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:09,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:09,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:09,330 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:09,617 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-28 08:21:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-28 08:21:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:21:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:21:09,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 08:21:09,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:09,749 INFO L225 Difference]: With dead ends: 76 [2022-04-28 08:21:09,749 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 08:21:09,752 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:21:09,754 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:09,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:21:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 08:21:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-28 08:21:09,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:09,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states 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:21:09,790 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states 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:21:09,791 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states 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:21:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:09,799 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 08:21:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 08:21:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:09,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:09,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-28 08:21:09,803 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-28 08:21:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:09,808 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 08:21:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 08:21:09,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:09,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:09,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:09,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states 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:21:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-28 08:21:09,816 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-28 08:21:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:09,818 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-28 08:21:09,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:09,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 74 transitions. [2022-04-28 08:21:09,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-28 08:21:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:21:09,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:09,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:21:09,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:21:09,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-28 08:21:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668829765] [2022-04-28 08:21:09,914 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-04-28 08:21:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278229548] [2022-04-28 08:21:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#(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); {414#true} is VALID [2022-04-28 08:21:10,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 08:21:10,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-28 08:21:10,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:10,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(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); {414#true} is VALID [2022-04-28 08:21:10,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 08:21:10,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-28 08:21:10,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret13 := main(); {414#true} is VALID [2022-04-28 08:21:10,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#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;havoc ~cond~0; {414#true} is VALID [2022-04-28 08:21:10,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {414#true} is VALID [2022-04-28 08:21:10,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#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; {414#true} is VALID [2022-04-28 08:21:10,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#true} assume !(0 != ~p1~0); {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(= main_~p1~0 0)} assume !(0 != ~p2~0); {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 08:21:10,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p1~0; {415#false} is VALID [2022-04-28 08:21:10,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#false} assume 1 != ~lk1~0; {415#false} is VALID [2022-04-28 08:21:10,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 08:21:10,035 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:21:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278229548] [2022-04-28 08:21:10,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278229548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668829765] [2022-04-28 08:21:10,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668829765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024127265] [2022-04-28 08:21:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-28 08:21:10,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:10,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:10,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:10,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:10,052 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,224 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-28 08:21:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:10,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-28 08:21:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 08:21:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 08:21:10,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 08:21:10,345 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:21:10,348 INFO L225 Difference]: With dead ends: 98 [2022-04-28 08:21:10,348 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 08:21:10,349 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:21:10,352 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 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:21:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 08:21:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-28 08:21:10,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:10,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states 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:21:10,376 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states 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:21:10,376 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states 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:21:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,382 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 08:21:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 08:21:10,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:10,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:10,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-28 08:21:10,384 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-28 08:21:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,390 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 08:21:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 08:21:10,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:10,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:10,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:10,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states 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:21:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-28 08:21:10,392 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-28 08:21:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:10,393 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-28 08:21:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states 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:21:10,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 102 transitions. [2022-04-28 08:21:10,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-28 08:21:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:21:10,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:10,467 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:21:10,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:21:10,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-28 08:21:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:10,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2135544736] [2022-04-28 08:21:10,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-04-28 08:21:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070420170] [2022-04-28 08:21:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#(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); {862#true} is VALID [2022-04-28 08:21:10,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-28 08:21:10,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-28 08:21:10,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:10,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#(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); {862#true} is VALID [2022-04-28 08:21:10,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-28 08:21:10,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-28 08:21:10,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret13 := main(); {862#true} is VALID [2022-04-28 08:21:10,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#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;havoc ~cond~0; {862#true} is VALID [2022-04-28 08:21:10,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {862#true} is VALID [2022-04-28 08:21:10,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#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; {862#true} is VALID [2022-04-28 08:21:10,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {862#true} assume 0 != ~p1~0;~lk1~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:21:10,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {863#false} is VALID [2022-04-28 08:21:10,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#false} assume 0 != ~p2~0; {863#false} is VALID [2022-04-28 08:21:10,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#false} assume 1 != ~lk2~0; {863#false} is VALID [2022-04-28 08:21:10,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#false} assume !false; {863#false} is VALID [2022-04-28 08:21:10,559 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:21:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:10,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070420170] [2022-04-28 08:21:10,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070420170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2135544736] [2022-04-28 08:21:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2135544736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571960045] [2022-04-28 08:21:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:10,561 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:21:10,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:10,561 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:21:10,575 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:21:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:10,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:10,576 INFO L87 Difference]: Start difference. First operand 59 states and 102 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:21:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,711 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-28 08:21:10,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:10,711 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:21:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:10,711 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:21:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:21:10,713 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:21:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 08:21:10,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 08:21:10,806 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:21:10,808 INFO L225 Difference]: With dead ends: 91 [2022-04-28 08:21:10,808 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 08:21:10,808 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:21:10,809 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 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:21:10,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 08:21:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-28 08:21:10,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:10,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states 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:21:10,819 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states 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:21:10,820 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states 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:21:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,821 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 08:21:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 08:21:10,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:10,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:10,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-28 08:21:10,822 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-28 08:21:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:10,824 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 08:21:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 08:21:10,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:10,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:10,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:10,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states 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:21:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-28 08:21:10,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-28 08:21:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:10,826 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-28 08:21:10,826 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:21:10,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 104 transitions. [2022-04-28 08:21:10,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-28 08:21:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:21:10,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:10,904 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:21:10,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:21:10,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-28 08:21:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:10,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1136081526] [2022-04-28 08:21:10,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-04-28 08:21:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:10,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108636214] [2022-04-28 08:21:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:10,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {1314#(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); {1308#true} is VALID [2022-04-28 08:21:10,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-28 08:21:10,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-28 08:21:10,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(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); {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret13 := main(); {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#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;havoc ~cond~0; {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#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; {1308#true} is VALID [2022-04-28 08:21:10,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(0 != ~p1~0); {1308#true} is VALID [2022-04-28 08:21:10,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !(0 != ~p2~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-28 08:21:10,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p2~0; {1309#false} is VALID [2022-04-28 08:21:10,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume 1 != ~lk2~0; {1309#false} is VALID [2022-04-28 08:21:10,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-28 08:21:10,952 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:21:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108636214] [2022-04-28 08:21:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108636214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1136081526] [2022-04-28 08:21:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1136081526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:10,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:10,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072963738] [2022-04-28 08:21:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:10,953 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:21:10,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:10,953 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:21:10,963 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:21:10,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:10,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:10,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:10,964 INFO L87 Difference]: Start difference. First operand 62 states and 104 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:21:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,083 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-28 08:21:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:11,084 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:21:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:11,084 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:21:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 08:21:11,085 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:21:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 08:21:11,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-28 08:21:11,184 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:21:11,186 INFO L225 Difference]: With dead ends: 166 [2022-04-28 08:21:11,186 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 08:21:11,186 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:21:11,187 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 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:21:11,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 08:21:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-28 08:21:11,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:11,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states 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:21:11,196 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states 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:21:11,196 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states 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:21:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,198 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-28 08:21:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-28 08:21:11,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:11,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:11,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 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 113 states. [2022-04-28 08:21:11,202 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 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 113 states. [2022-04-28 08:21:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,205 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-28 08:21:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-28 08:21:11,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:11,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:11,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:11,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states 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:21:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-28 08:21:11,209 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-28 08:21:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:11,209 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-28 08:21:11,209 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:21:11,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 189 transitions. [2022-04-28 08:21:11,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-28 08:21:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:21:11,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:11,344 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:21:11,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:21:11,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-28 08:21:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309524716] [2022-04-28 08:21:11,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-04-28 08:21:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410605536] [2022-04-28 08:21:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:11,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:11,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {2106#(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); {2100#true} is VALID [2022-04-28 08:21:11,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-28 08:21:11,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-28 08:21:11,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:11,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2106#(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); {2100#true} is VALID [2022-04-28 08:21:11,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-28 08:21:11,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-28 08:21:11,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret13 := main(); {2100#true} is VALID [2022-04-28 08:21:11,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2100#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;havoc ~cond~0; {2100#true} is VALID [2022-04-28 08:21:11,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2100#true} is VALID [2022-04-28 08:21:11,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#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; {2100#true} is VALID [2022-04-28 08:21:11,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#true} assume !(0 != ~p1~0); {2100#true} is VALID [2022-04-28 08:21:11,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#true} assume 0 != ~p2~0;~lk2~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 08:21:11,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2101#false} is VALID [2022-04-28 08:21:11,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-04-28 08:21:11,393 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:21:11,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410605536] [2022-04-28 08:21:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410605536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:11,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:11,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309524716] [2022-04-28 08:21:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309524716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:11,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263869783] [2022-04-28 08:21:11,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:11,395 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:21:11,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:11,396 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:21:11,406 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:21:11,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:11,407 INFO L87 Difference]: Start difference. First operand 111 states and 189 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:21:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,513 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-28 08:21:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:11,514 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:21:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:11,515 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:21:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 08:21:11,516 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:21:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 08:21:11,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-28 08:21:11,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:11,581 INFO L225 Difference]: With dead ends: 143 [2022-04-28 08:21:11,581 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 08:21:11,581 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:21:11,582 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 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:21:11,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 08:21:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-28 08:21:11,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:11,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states 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:21:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states 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:21:11,600 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states 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:21:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,603 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-28 08:21:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-28 08:21:11,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:11,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:11,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-28 08:21:11,604 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-28 08:21:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,608 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-28 08:21:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-28 08:21:11,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:11,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:11,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:11,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states 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:21:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-28 08:21:11,611 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-28 08:21:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:11,612 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-28 08:21:11,612 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:21:11,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 187 transitions. [2022-04-28 08:21:11,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-28 08:21:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:21:11,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:11,768 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:21:11,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:21:11,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-28 08:21:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678932705] [2022-04-28 08:21:11,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-04-28 08:21:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:11,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682102023] [2022-04-28 08:21:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:11,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {2908#(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); {2902#true} is VALID [2022-04-28 08:21:11,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-28 08:21:11,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {2908#(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); {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret13 := main(); {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#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;havoc ~cond~0; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2902#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2902#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; {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#true} assume !(0 != ~p1~0); {2902#true} is VALID [2022-04-28 08:21:11,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {2902#true} assume !(0 != ~p2~0); {2902#true} is VALID [2022-04-28 08:21:11,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#true} assume 0 != ~p3~0;~lk3~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 08:21:11,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {2907#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2903#false} is VALID [2022-04-28 08:21:11,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-28 08:21:11,849 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:21:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682102023] [2022-04-28 08:21:11,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682102023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:11,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:11,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:11,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678932705] [2022-04-28 08:21:11,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678932705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:11,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:11,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905829651] [2022-04-28 08:21:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:11,850 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:21:11,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:11,851 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:21:11,862 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:21:11,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:11,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:11,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:11,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:11,862 INFO L87 Difference]: Start difference. First operand 111 states and 187 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:21:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:11,985 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-28 08:21:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:11,985 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:21:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:11,986 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:21:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 08:21:11,987 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:21:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 08:21:11,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 08:21:12,047 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:21:12,053 INFO L225 Difference]: With dead ends: 203 [2022-04-28 08:21:12,053 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 08:21:12,053 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:21:12,054 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 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:21:12,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 08:21:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-28 08:21:12,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:12,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states 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:21:12,071 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states 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:21:12,071 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states 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:21:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:12,078 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-28 08:21:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-28 08:21:12,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:12,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:12,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-28 08:21:12,079 INFO L87 Difference]: Start difference. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-28 08:21:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:12,087 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-28 08:21:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-28 08:21:12,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:12,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:12,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:12,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states 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:21:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-28 08:21:12,093 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-28 08:21:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:12,093 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-28 08:21:12,093 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:21:12,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 253 transitions. [2022-04-28 08:21:12,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-28 08:21:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:21:12,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:12,311 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:21:12,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:21:12,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:12,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-28 08:21:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:12,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340272596] [2022-04-28 08:21:12,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-04-28 08:21:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:12,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933378191] [2022-04-28 08:21:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:12,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {4030#(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); {4024#true} is VALID [2022-04-28 08:21:12,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-28 08:21:12,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-28 08:21:12,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {4024#true} call ULTIMATE.init(); {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {4030#(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); {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {4024#true} call #t~ret13 := main(); {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {4024#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;havoc ~cond~0; {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {4024#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {4024#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; {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {4024#true} assume !(0 != ~p1~0); {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#true} assume !(0 != ~p2~0); {4024#true} is VALID [2022-04-28 08:21:12,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#true} assume !(0 != ~p3~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 08:21:12,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p3~0; {4025#false} is VALID [2022-04-28 08:21:12,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#false} assume 1 != ~lk3~0; {4025#false} is VALID [2022-04-28 08:21:12,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-04-28 08:21:12,344 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:21:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933378191] [2022-04-28 08:21:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933378191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:12,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:12,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340272596] [2022-04-28 08:21:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340272596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:12,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74014241] [2022-04-28 08:21:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:12,345 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:21:12,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:12,345 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:21:12,358 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:21:12,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:12,359 INFO L87 Difference]: Start difference. First operand 151 states and 253 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:21:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:12,493 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-28 08:21:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:12,494 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:21:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:12,494 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:21:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 08:21:12,496 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:21:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 08:21:12,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-28 08:21:12,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:12,594 INFO L225 Difference]: With dead ends: 351 [2022-04-28 08:21:12,594 INFO L226 Difference]: Without dead ends: 209 [2022-04-28 08:21:12,595 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:21:12,595 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:12,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-28 08:21:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-28 08:21:12,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:12,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states 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:21:12,607 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states 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:21:12,607 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states 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:21:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:12,612 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-28 08:21:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-28 08:21:12,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:12,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:12,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-28 08:21:12,613 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-28 08:21:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:12,618 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-28 08:21:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-28 08:21:12,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:12,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:12,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:12,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states 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:21:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-28 08:21:12,634 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-28 08:21:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:12,634 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-28 08:21:12,635 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:21:12,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 343 transitions. [2022-04-28 08:21:12,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-28 08:21:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:21:12,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:12,940 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:21:12,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:21:12,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-28 08:21:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:12,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222456080] [2022-04-28 08:21:12,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-04-28 08:21:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:12,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012134003] [2022-04-28 08:21:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:12,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:12,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {5576#(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); {5570#true} is VALID [2022-04-28 08:21:12,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:12,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#(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); {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret13 := main(); {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#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;havoc ~cond~0; {5570#true} is VALID [2022-04-28 08:21:12,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {5570#true} is VALID [2022-04-28 08:21:12,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#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; {5570#true} is VALID [2022-04-28 08:21:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#true} assume !(0 != ~p1~0); {5570#true} is VALID [2022-04-28 08:21:12,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#true} assume !(0 != ~p2~0); {5570#true} is VALID [2022-04-28 08:21:12,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {5570#true} assume 0 != ~p3~0;~lk3~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:21:12,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5571#false} is VALID [2022-04-28 08:21:12,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {5571#false} assume 0 != ~p4~0; {5571#false} is VALID [2022-04-28 08:21:12,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#false} assume 1 != ~lk4~0; {5571#false} is VALID [2022-04-28 08:21:12,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-28 08:21:12,985 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:21:12,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:12,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012134003] [2022-04-28 08:21:12,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012134003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:12,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:12,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:12,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:12,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1222456080] [2022-04-28 08:21:12,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1222456080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:12,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:12,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830941979] [2022-04-28 08:21:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:12,986 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:21:12,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:12,986 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:21:12,997 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:21:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:12,998 INFO L87 Difference]: Start difference. First operand 207 states and 343 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:21:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,117 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-28 08:21:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:13,117 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:21:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:13,117 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:21:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 08:21:13,118 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:21:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 08:21:13,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-28 08:21:13,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:13,206 INFO L225 Difference]: With dead ends: 313 [2022-04-28 08:21:13,206 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 08:21:13,206 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:21:13,207 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:13,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 08:21:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-28 08:21:13,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:13,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states 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:21:13,218 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states 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:21:13,219 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states 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:21:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,223 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-28 08:21:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-28 08:21:13,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:13,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:13,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 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 215 states. [2022-04-28 08:21:13,226 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 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 215 states. [2022-04-28 08:21:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,230 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-28 08:21:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-28 08:21:13,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:13,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:13,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:13,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states 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:21:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-28 08:21:13,235 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-28 08:21:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:13,235 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-28 08:21:13,235 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:21:13,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 347 transitions. [2022-04-28 08:21:13,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-28 08:21:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:21:13,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:13,549 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:21:13,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:21:13,550 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-28 08:21:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:13,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049727506] [2022-04-28 08:21:13,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-04-28 08:21:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:13,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410468808] [2022-04-28 08:21:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:13,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {7070#(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); {7064#true} is VALID [2022-04-28 08:21:13,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-28 08:21:13,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-28 08:21:13,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {7064#true} call ULTIMATE.init(); {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#(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); {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call #t~ret13 := main(); {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#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;havoc ~cond~0; {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {7064#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; {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume !(0 != ~p1~0); {7064#true} is VALID [2022-04-28 08:21:13,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume !(0 != ~p2~0); {7064#true} is VALID [2022-04-28 08:21:13,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume !(0 != ~p3~0); {7064#true} is VALID [2022-04-28 08:21:13,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume 0 != ~p4~0;~lk4~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 08:21:13,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7065#false} is VALID [2022-04-28 08:21:13,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-04-28 08:21:13,614 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:21:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410468808] [2022-04-28 08:21:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410468808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:13,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049727506] [2022-04-28 08:21:13,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049727506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:13,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:13,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133680647] [2022-04-28 08:21:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:13,615 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:21:13,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:13,615 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:21:13,628 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:21:13,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:13,629 INFO L87 Difference]: Start difference. First operand 213 states and 347 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:21:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,764 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-28 08:21:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:13,764 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:21:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:13,765 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:21:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 08:21:13,766 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:21:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 08:21:13,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 08:21:13,824 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:21:13,831 INFO L225 Difference]: With dead ends: 381 [2022-04-28 08:21:13,831 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 08:21:13,831 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:21:13,833 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 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:21:13,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 08:21:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-28 08:21:13,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:13,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states 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:21:13,859 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states 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:21:13,859 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states 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:21:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,869 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-28 08:21:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-28 08:21:13,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:13,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:13,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-28 08:21:13,870 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-28 08:21:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:13,878 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-28 08:21:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-28 08:21:13,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:13,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:13,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:13,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states 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:21:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-28 08:21:13,885 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-28 08:21:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:13,886 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-28 08:21:13,886 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:21:13,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 475 transitions. [2022-04-28 08:21:14,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-28 08:21:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:21:14,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:14,298 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:21:14,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:21:14,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-28 08:21:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397157719] [2022-04-28 08:21:14,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-04-28 08:21:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686044814] [2022-04-28 08:21:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:14,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {9196#(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); {9190#true} is VALID [2022-04-28 08:21:14,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-28 08:21:14,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {9190#true} call ULTIMATE.init(); {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {9196#(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); {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret13 := main(); {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {9190#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;havoc ~cond~0; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {9190#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {9190#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; {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {9190#true} assume !(0 != ~p1~0); {9190#true} is VALID [2022-04-28 08:21:14,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {9190#true} assume !(0 != ~p2~0); {9190#true} is VALID [2022-04-28 08:21:14,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#true} assume !(0 != ~p3~0); {9190#true} is VALID [2022-04-28 08:21:14,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {9190#true} assume !(0 != ~p4~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 08:21:14,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p4~0; {9191#false} is VALID [2022-04-28 08:21:14,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#false} assume 1 != ~lk4~0; {9191#false} is VALID [2022-04-28 08:21:14,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2022-04-28 08:21:14,340 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:21:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686044814] [2022-04-28 08:21:14,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686044814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:14,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:14,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:14,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:14,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397157719] [2022-04-28 08:21:14,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397157719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:14,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:14,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277407720] [2022-04-28 08:21:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:14,341 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:21:14,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:14,342 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:21:14,352 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:21:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:14,352 INFO L87 Difference]: Start difference. First operand 297 states and 475 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:21:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:14,485 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-28 08:21:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:14,485 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:21:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:14,486 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:21:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:21:14,487 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:21:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:21:14,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 08:21:14,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:14,580 INFO L225 Difference]: With dead ends: 685 [2022-04-28 08:21:14,580 INFO L226 Difference]: Without dead ends: 403 [2022-04-28 08:21:14,582 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:21:14,583 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 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:21:14,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-28 08:21:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-28 08:21:14,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:14,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:14,605 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:14,606 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:14,615 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-28 08:21:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-28 08:21:14,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:14,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:14,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 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 403 states. [2022-04-28 08:21:14,616 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 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 403 states. [2022-04-28 08:21:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:14,624 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-28 08:21:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-28 08:21:14,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:14,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:14,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:14,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-28 08:21:14,635 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-28 08:21:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:14,635 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-28 08:21:14,635 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:21:14,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 631 transitions. [2022-04-28 08:21:15,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-28 08:21:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:21:15,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:15,224 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:21:15,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:21:15,224 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-28 08:21:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:15,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836707517] [2022-04-28 08:21:15,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-04-28 08:21:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:15,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834590059] [2022-04-28 08:21:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:15,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {12186#(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); {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {12180#true} call ULTIMATE.init(); {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:15,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {12186#(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); {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {12180#true} call #t~ret13 := main(); {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {12180#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;havoc ~cond~0; {12180#true} is VALID [2022-04-28 08:21:15,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {12180#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {12180#true} is VALID [2022-04-28 08:21:15,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {12180#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; {12180#true} is VALID [2022-04-28 08:21:15,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0 != ~p1~0); {12180#true} is VALID [2022-04-28 08:21:15,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0 != ~p2~0); {12180#true} is VALID [2022-04-28 08:21:15,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {12180#true} assume !(0 != ~p3~0); {12180#true} is VALID [2022-04-28 08:21:15,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {12180#true} assume 0 != ~p4~0;~lk4~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:21:15,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12181#false} is VALID [2022-04-28 08:21:15,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {12181#false} assume 0 != ~p5~0; {12181#false} is VALID [2022-04-28 08:21:15,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {12181#false} assume 1 != ~lk5~0; {12181#false} is VALID [2022-04-28 08:21:15,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-04-28 08:21:15,278 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:21:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:15,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834590059] [2022-04-28 08:21:15,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834590059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:15,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:15,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:15,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836707517] [2022-04-28 08:21:15,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836707517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:15,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:15,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170934926] [2022-04-28 08:21:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:15,279 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:21:15,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:15,279 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:21:15,290 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:21:15,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:15,291 INFO L87 Difference]: Start difference. First operand 401 states and 631 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:21:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:15,432 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-28 08:21:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:15,432 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:21:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:15,432 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:21:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 08:21:15,434 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:21:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 08:21:15,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-28 08:21:15,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:15,531 INFO L225 Difference]: With dead ends: 601 [2022-04-28 08:21:15,531 INFO L226 Difference]: Without dead ends: 411 [2022-04-28 08:21:15,532 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:21:15,532 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:15,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-28 08:21:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-28 08:21:15,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:15,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:15,564 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:15,565 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:15,575 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-28 08:21:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-28 08:21:15,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:15,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:15,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 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 411 states. [2022-04-28 08:21:15,576 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 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 411 states. [2022-04-28 08:21:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:15,585 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-28 08:21:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-28 08:21:15,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:15,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:15,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:15,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states 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:21:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-28 08:21:15,595 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-28 08:21:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:15,595 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-28 08:21:15,595 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:21:15,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 409 states and 631 transitions. [2022-04-28 08:21:16,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-28 08:21:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:21:16,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:16,176 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:21:16,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:21:16,176 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-28 08:21:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:16,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1185179204] [2022-04-28 08:21:16,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-04-28 08:21:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:16,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423671607] [2022-04-28 08:21:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:16,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {15040#(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); {15034#true} is VALID [2022-04-28 08:21:16,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-28 08:21:16,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-28 08:21:16,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {15034#true} call ULTIMATE.init(); {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {15040#(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); {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {15034#true} call #t~ret13 := main(); {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {15034#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;havoc ~cond~0; {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#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; {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {15034#true} assume !(0 != ~p1~0); {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {15034#true} assume !(0 != ~p2~0); {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {15034#true} assume !(0 != ~p3~0); {15034#true} is VALID [2022-04-28 08:21:16,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#true} assume !(0 != ~p4~0); {15034#true} is VALID [2022-04-28 08:21:16,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#true} assume 0 != ~p5~0;~lk5~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 08:21:16,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {15039#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15035#false} is VALID [2022-04-28 08:21:16,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {15035#false} assume !false; {15035#false} is VALID [2022-04-28 08:21:16,219 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:21:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:16,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423671607] [2022-04-28 08:21:16,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423671607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:16,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:16,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:16,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:16,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1185179204] [2022-04-28 08:21:16,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1185179204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:16,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:16,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044745664] [2022-04-28 08:21:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:16,220 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:21:16,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:16,220 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:21:16,234 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:21:16,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:16,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:16,234 INFO L87 Difference]: Start difference. First operand 409 states and 631 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:21:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:16,408 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-28 08:21:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:16,409 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:21:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:16,409 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:21:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:21:16,410 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:21:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 08:21:16,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 08:21:16,463 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:21:16,491 INFO L225 Difference]: With dead ends: 717 [2022-04-28 08:21:16,492 INFO L226 Difference]: Without dead ends: 715 [2022-04-28 08:21:16,492 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:21:16,492 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 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:21:16,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-28 08:21:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-28 08:21:16,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:16,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states 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:21:16,531 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states 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:21:16,532 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states 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:21:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:16,551 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-28 08:21:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-28 08:21:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:16,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-28 08:21:16,554 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-28 08:21:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:16,574 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-28 08:21:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-28 08:21:16,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:16,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:16,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:16,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states 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:21:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-28 08:21:16,594 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-28 08:21:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:16,594 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-28 08:21:16,595 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:21:16,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 879 transitions. [2022-04-28 08:21:17,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-28 08:21:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:21:17,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:17,415 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:21:17,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:21:17,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-28 08:21:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:17,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1702725755] [2022-04-28 08:21:17,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-04-28 08:21:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:17,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094126388] [2022-04-28 08:21:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:17,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {19086#(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); {19080#true} is VALID [2022-04-28 08:21:17,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-28 08:21:17,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-28 08:21:17,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {19080#true} call ULTIMATE.init(); {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {19086#(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); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {19080#true} call #t~ret13 := main(); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {19080#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;havoc ~cond~0; {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {19080#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19080#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; {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {19080#true} assume !(0 != ~p1~0); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {19080#true} assume !(0 != ~p2~0); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {19080#true} assume !(0 != ~p3~0); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {19080#true} assume !(0 != ~p4~0); {19080#true} is VALID [2022-04-28 08:21:17,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {19080#true} assume !(0 != ~p5~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 08:21:17,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p5~0; {19081#false} is VALID [2022-04-28 08:21:17,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {19081#false} assume 1 != ~lk5~0; {19081#false} is VALID [2022-04-28 08:21:17,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {19081#false} assume !false; {19081#false} is VALID [2022-04-28 08:21:17,462 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:21:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:17,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094126388] [2022-04-28 08:21:17,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094126388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:17,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:17,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:17,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:17,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1702725755] [2022-04-28 08:21:17,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1702725755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:17,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:17,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795429219] [2022-04-28 08:21:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:17,464 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:21:17,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:17,464 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:21:17,475 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:21:17,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:17,476 INFO L87 Difference]: Start difference. First operand 585 states and 879 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:21:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:17,700 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-28 08:21:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:17,700 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:21:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:17,701 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:21:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 08:21:17,702 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:21:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 08:21:17,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-28 08:21:17,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:17,810 INFO L225 Difference]: With dead ends: 1341 [2022-04-28 08:21:17,810 INFO L226 Difference]: Without dead ends: 779 [2022-04-28 08:21:17,811 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:21:17,813 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:17,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-28 08:21:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-28 08:21:17,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:17,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:17,858 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:17,859 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:17,882 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-28 08:21:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-28 08:21:17,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:17,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:17,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-28 08:21:17,885 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-28 08:21:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:17,910 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-28 08:21:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-28 08:21:17,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:17,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:17,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:17,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-28 08:21:17,946 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-28 08:21:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:17,947 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-28 08:21:17,947 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:21:17,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1143 transitions. [2022-04-28 08:21:18,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-28 08:21:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:21:18,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:18,966 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:21:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:21:18,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-28 08:21:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:18,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559750388] [2022-04-28 08:21:18,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-04-28 08:21:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867028909] [2022-04-28 08:21:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:19,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:19,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {24892#(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); {24886#true} is VALID [2022-04-28 08:21:19,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-28 08:21:19,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-28 08:21:19,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {24886#true} call ULTIMATE.init(); {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:19,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {24892#(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); {24886#true} is VALID [2022-04-28 08:21:19,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-28 08:21:19,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {24886#true} call #t~ret13 := main(); {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {24886#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;havoc ~cond~0; {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {24886#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {24886#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; {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {24886#true} assume !(0 != ~p1~0); {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {24886#true} assume !(0 != ~p2~0); {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {24886#true} assume !(0 != ~p3~0); {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {24886#true} assume !(0 != ~p4~0); {24886#true} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {24886#true} assume 0 != ~p5~0;~lk5~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24887#false} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#false} assume 0 != ~p6~0; {24887#false} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#false} assume 1 != ~lk6~0; {24887#false} is VALID [2022-04-28 08:21:19,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-04-28 08:21:19,019 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:21:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867028909] [2022-04-28 08:21:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867028909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:19,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:19,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:19,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1559750388] [2022-04-28 08:21:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1559750388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:19,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:19,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559994795] [2022-04-28 08:21:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:19,020 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:21:19,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:19,021 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:21:19,036 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:21:19,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:19,039 INFO L87 Difference]: Start difference. First operand 777 states and 1143 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:21:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:19,273 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-28 08:21:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:19,273 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:21:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:19,273 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:21:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:21:19,275 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:21:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:21:19,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 08:21:19,364 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:21:19,392 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 08:21:19,392 INFO L226 Difference]: Without dead ends: 795 [2022-04-28 08:21:19,392 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:21:19,393 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:19,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-28 08:21:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-28 08:21:19,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:19,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:19,450 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:19,451 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:19,474 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-28 08:21:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-28 08:21:19,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:19,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:19,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-28 08:21:19,477 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-28 08:21:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:19,500 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-28 08:21:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-28 08:21:19,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:19,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:19,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:19,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states 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:21:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-28 08:21:19,535 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-28 08:21:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:19,535 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-28 08:21:19,536 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:21:19,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1143 transitions. [2022-04-28 08:21:20,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-28 08:21:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:21:20,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:20,577 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:21:20,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:21:20,578 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-28 08:21:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:20,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874916529] [2022-04-28 08:21:20,578 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-04-28 08:21:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:20,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630179302] [2022-04-28 08:21:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:20,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {30410#(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); {30404#true} is VALID [2022-04-28 08:21:20,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-28 08:21:20,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-28 08:21:20,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {30404#true} call ULTIMATE.init(); {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:20,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {30410#(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); {30404#true} is VALID [2022-04-28 08:21:20,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-28 08:21:20,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-28 08:21:20,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {30404#true} call #t~ret13 := main(); {30404#true} is VALID [2022-04-28 08:21:20,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {30404#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;havoc ~cond~0; {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {30404#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {30404#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; {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {30404#true} assume !(0 != ~p1~0); {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {30404#true} assume !(0 != ~p2~0); {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {30404#true} assume !(0 != ~p3~0); {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {30404#true} assume !(0 != ~p4~0); {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {30404#true} assume !(0 != ~p5~0); {30404#true} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {30404#true} assume 0 != ~p6~0;~lk6~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 08:21:20,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {30409#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30405#false} is VALID [2022-04-28 08:21:20,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {30405#false} assume !false; {30405#false} is VALID [2022-04-28 08:21:20,613 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:21:20,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630179302] [2022-04-28 08:21:20,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630179302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:20,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:20,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:20,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874916529] [2022-04-28 08:21:20,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874916529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:20,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:20,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996656006] [2022-04-28 08:21:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:20,615 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:21:20,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:20,615 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:21:20,626 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:21:20,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:20,627 INFO L87 Difference]: Start difference. First operand 793 states and 1143 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:21:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:20,873 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-28 08:21:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:20,873 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:21:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:20,873 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:21:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 08:21:20,875 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:21:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 08:21:20,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 08:21:20,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:20,999 INFO L225 Difference]: With dead ends: 1357 [2022-04-28 08:21:20,999 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 08:21:21,001 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:21:21,002 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:21,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 08:21:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-28 08:21:21,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:21,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states 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:21:21,083 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states 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:21:21,084 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states 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:21:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:21,137 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-28 08:21:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-28 08:21:21,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:21,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:21,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 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 1355 states. [2022-04-28 08:21:21,141 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 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 1355 states. [2022-04-28 08:21:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:21,197 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-28 08:21:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-28 08:21:21,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:21,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:21,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:21,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states 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:21:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-28 08:21:21,265 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-28 08:21:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:21,265 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-28 08:21:21,265 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:21:21,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1623 transitions. [2022-04-28 08:21:22,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-28 08:21:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:21:22,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:22,732 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:21:22,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:21:22,732 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-28 08:21:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:22,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444936892] [2022-04-28 08:21:22,733 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-04-28 08:21:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:22,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950815936] [2022-04-28 08:21:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:22,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {38168#(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); {38162#true} is VALID [2022-04-28 08:21:22,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-28 08:21:22,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-28 08:21:22,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {38162#true} call ULTIMATE.init(); {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {38168#(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); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {38162#true} call #t~ret13 := main(); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {38162#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;havoc ~cond~0; {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {38162#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {38162#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; {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {38162#true} assume !(0 != ~p1~0); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {38162#true} assume !(0 != ~p2~0); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {38162#true} assume !(0 != ~p3~0); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {38162#true} assume !(0 != ~p4~0); {38162#true} is VALID [2022-04-28 08:21:22,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {38162#true} assume !(0 != ~p5~0); {38162#true} is VALID [2022-04-28 08:21:22,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {38162#true} assume !(0 != ~p6~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p6~0; {38163#false} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {38163#false} assume 1 != ~lk6~0; {38163#false} is VALID [2022-04-28 08:21:22,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {38163#false} assume !false; {38163#false} is VALID [2022-04-28 08:21:22,774 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:21:22,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:22,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950815936] [2022-04-28 08:21:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950815936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:22,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:22,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444936892] [2022-04-28 08:21:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444936892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184623649] [2022-04-28 08:21:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:22,775 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:21:22,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:22,775 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:21:22,786 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:21:22,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:22,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:22,787 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 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:21:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:23,289 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-28 08:21:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:23,289 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:21:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:23,290 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:21:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 08:21:23,291 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:21:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 08:21:23,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-28 08:21:23,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:23,455 INFO L225 Difference]: With dead ends: 2637 [2022-04-28 08:21:23,455 INFO L226 Difference]: Without dead ends: 1515 [2022-04-28 08:21:23,457 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:21:23,457 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:23,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-28 08:21:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-28 08:21:23,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:23,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:23,562 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:23,564 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:23,642 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-28 08:21:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-28 08:21:23,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:23,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:23,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-28 08:21:23,647 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-28 08:21:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:23,752 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-28 08:21:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-28 08:21:23,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:23,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:23,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:23,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-28 08:21:23,888 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-28 08:21:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:23,888 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-28 08:21:23,888 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:21:23,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1513 states and 2055 transitions. [2022-04-28 08:21:25,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-28 08:21:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:21:25,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:25,855 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:21:25,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:21:25,856 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-28 08:21:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203857285] [2022-04-28 08:21:25,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-04-28 08:21:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:25,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45500637] [2022-04-28 08:21:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:25,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:25,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {49510#(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); {49504#true} is VALID [2022-04-28 08:21:25,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-28 08:21:25,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-28 08:21:25,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {49504#true} call ULTIMATE.init(); {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {49510#(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); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {49504#true} call #t~ret13 := main(); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {49504#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;havoc ~cond~0; {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {49504#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#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; {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#true} assume !(0 != ~p1~0); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#true} assume !(0 != ~p2~0); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#true} assume !(0 != ~p3~0); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {49504#true} assume !(0 != ~p4~0); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {49504#true} assume !(0 != ~p5~0); {49504#true} is VALID [2022-04-28 08:21:25,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {49504#true} assume 0 != ~p6~0;~lk6~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:21:25,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49505#false} is VALID [2022-04-28 08:21:25,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {49505#false} assume 0 != ~p7~0; {49505#false} is VALID [2022-04-28 08:21:25,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {49505#false} assume 1 != ~lk7~0; {49505#false} is VALID [2022-04-28 08:21:25,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {49505#false} assume !false; {49505#false} is VALID [2022-04-28 08:21:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:21:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45500637] [2022-04-28 08:21:25,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45500637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:25,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:25,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:25,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203857285] [2022-04-28 08:21:25,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203857285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:25,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:25,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155459281] [2022-04-28 08:21:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:25,909 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:21:25,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:25,909 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:21:25,921 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:21:25,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:25,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:25,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:25,921 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 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:21:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:26,333 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-28 08:21:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:26,333 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:21:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:26,334 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:21:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:21:26,335 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:21:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:21:26,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 08:21:26,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:26,521 INFO L225 Difference]: With dead ends: 2269 [2022-04-28 08:21:26,521 INFO L226 Difference]: Without dead ends: 1547 [2022-04-28 08:21:26,522 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:21:26,523 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:26,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-28 08:21:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-28 08:21:26,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:26,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:26,620 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:26,621 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:26,697 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-28 08:21:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-28 08:21:26,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:26,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:26,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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:21:26,702 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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:21:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:26,775 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-28 08:21:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-28 08:21:26,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:26,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:26,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:26,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states 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:21:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-28 08:21:26,903 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-28 08:21:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:26,903 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-28 08:21:26,903 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:21:26,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2055 transitions. [2022-04-28 08:21:28,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-28 08:21:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:21:28,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:28,864 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:21:28,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:21:28,864 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-28 08:21:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237121631] [2022-04-28 08:21:28,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-04-28 08:21:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:28,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402126444] [2022-04-28 08:21:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:28,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {60244#(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); {60238#true} is VALID [2022-04-28 08:21:28,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-28 08:21:28,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-28 08:21:28,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {60238#true} call ULTIMATE.init(); {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:28,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {60244#(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); {60238#true} is VALID [2022-04-28 08:21:28,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {60238#true} call #t~ret13 := main(); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {60238#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;havoc ~cond~0; {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {60238#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {60238#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; {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {60238#true} assume !(0 != ~p1~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {60238#true} assume !(0 != ~p2~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {60238#true} assume !(0 != ~p3~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {60238#true} assume !(0 != ~p4~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {60238#true} assume !(0 != ~p5~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {60238#true} assume !(0 != ~p6~0); {60238#true} is VALID [2022-04-28 08:21:28,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {60238#true} assume 0 != ~p7~0;~lk7~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p7~0; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 08:21:28,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {60243#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {60239#false} is VALID [2022-04-28 08:21:28,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {60239#false} assume !false; {60239#false} is VALID [2022-04-28 08:21:28,904 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:21:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:28,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402126444] [2022-04-28 08:21:28,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402126444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:28,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:28,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:28,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:28,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237121631] [2022-04-28 08:21:28,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237121631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:28,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:28,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024016076] [2022-04-28 08:21:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:28,905 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:21:28,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:28,905 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:21:28,917 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:21:28,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:28,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:28,918 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 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:21:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:29,451 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-28 08:21:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:29,451 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:21:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:29,451 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:21:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 08:21:29,452 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:21:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 08:21:29,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-28 08:21:29,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:29,771 INFO L225 Difference]: With dead ends: 2573 [2022-04-28 08:21:29,772 INFO L226 Difference]: Without dead ends: 2571 [2022-04-28 08:21:29,772 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:21:29,772 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:29,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-28 08:21:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-28 08:21:29,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:29,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states 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:21:29,924 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states 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:21:29,926 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states 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:21:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:30,111 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-28 08:21:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-28 08:21:30,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:30,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:30,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-28 08:21:30,118 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-28 08:21:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:30,305 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-28 08:21:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-28 08:21:30,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:30,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:30,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:30,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states 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:21:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-28 08:21:30,552 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-28 08:21:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:30,552 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-28 08:21:30,552 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:21:30,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 2983 transitions. [2022-04-28 08:21:33,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2983 edges. 2983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-28 08:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:21:33,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:33,334 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:21:33,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:21:33,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-28 08:21:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910875368] [2022-04-28 08:21:33,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-04-28 08:21:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808635235] [2022-04-28 08:21:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:33,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {75170#(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); {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {75164#true} call ULTIMATE.init(); {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:33,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {75170#(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); {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-28 08:21:33,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {75164#true} call #t~ret13 := main(); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {75164#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;havoc ~cond~0; {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {75164#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {75164#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; {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {75164#true} assume !(0 != ~p1~0); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {75164#true} assume !(0 != ~p2~0); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {75164#true} assume !(0 != ~p3~0); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {75164#true} assume !(0 != ~p4~0); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {75164#true} assume !(0 != ~p5~0); {75164#true} is VALID [2022-04-28 08:21:33,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {75164#true} assume !(0 != ~p6~0); {75164#true} is VALID [2022-04-28 08:21:33,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {75164#true} assume !(0 != ~p7~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 08:21:33,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p7~0; {75165#false} is VALID [2022-04-28 08:21:33,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {75165#false} assume 1 != ~lk7~0; {75165#false} is VALID [2022-04-28 08:21:33,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {75165#false} assume !false; {75165#false} is VALID [2022-04-28 08:21:33,366 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:21:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808635235] [2022-04-28 08:21:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808635235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:33,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:33,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:33,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910875368] [2022-04-28 08:21:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910875368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:33,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:33,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452192352] [2022-04-28 08:21:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:33,367 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:21:33,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:33,368 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:21:33,380 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:21:33,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:33,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:33,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:33,380 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 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:21:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:34,931 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-28 08:21:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:34,931 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:21:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:34,931 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:21:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 08:21:34,932 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:21:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 08:21:34,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-28 08:21:35,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:35,376 INFO L225 Difference]: With dead ends: 5197 [2022-04-28 08:21:35,376 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 08:21:35,379 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:21:35,379 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:35,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 08:21:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-28 08:21:35,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:35,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:35,575 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:35,577 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:35,875 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-28 08:21:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-28 08:21:35,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:35,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:35,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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:21:35,884 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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:21:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:36,143 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-28 08:21:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-28 08:21:36,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:36,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:36,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:36,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-28 08:21:36,557 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-28 08:21:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:36,558 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-28 08:21:36,558 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:21:36,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2953 states and 3655 transitions. [2022-04-28 08:21:40,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-28 08:21:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:21:40,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:40,152 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:21:40,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:21:40,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-28 08:21:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:40,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916685491] [2022-04-28 08:21:40,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-04-28 08:21:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:40,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730257931] [2022-04-28 08:21:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:40,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {97392#(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); {97386#true} is VALID [2022-04-28 08:21:40,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-28 08:21:40,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-28 08:21:40,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {97386#true} call ULTIMATE.init(); {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {97392#(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); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {97386#true} call #t~ret13 := main(); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {97386#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;havoc ~cond~0; {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {97386#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {97386#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; {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {97386#true} assume !(0 != ~p1~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {97386#true} assume !(0 != ~p2~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {97386#true} assume !(0 != ~p3~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {97386#true} assume !(0 != ~p4~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {97386#true} assume !(0 != ~p5~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {97386#true} assume !(0 != ~p6~0); {97386#true} is VALID [2022-04-28 08:21:40,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {97386#true} assume 0 != ~p7~0;~lk7~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {97391#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:21:40,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97387#false} is VALID [2022-04-28 08:21:40,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {97387#false} assume 0 != ~p8~0; {97387#false} is VALID [2022-04-28 08:21:40,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {97387#false} assume 1 != ~lk8~0; {97387#false} is VALID [2022-04-28 08:21:40,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {97387#false} assume !false; {97387#false} is VALID [2022-04-28 08:21:40,189 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:21:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730257931] [2022-04-28 08:21:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730257931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:40,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916685491] [2022-04-28 08:21:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916685491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716748289] [2022-04-28 08:21:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:40,191 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:21:40,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:40,191 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:21:40,204 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:21:40,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:40,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:40,205 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 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:21:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:41,459 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-28 08:21:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:41,459 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:21:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:41,459 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:21:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:21:41,460 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:21:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:21:41,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 08:21:41,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:41,928 INFO L225 Difference]: With dead ends: 4429 [2022-04-28 08:21:41,928 INFO L226 Difference]: Without dead ends: 3019 [2022-04-28 08:21:41,930 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:21:41,930 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:41,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-28 08:21:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-28 08:21:42,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:42,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:42,128 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:42,130 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:42,429 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-28 08:21:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-28 08:21:42,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:42,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:42,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-28 08:21:42,435 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-28 08:21:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:42,713 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-28 08:21:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-28 08:21:42,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:42,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:42,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:42,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states 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:21:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-28 08:21:43,144 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-28 08:21:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:43,144 INFO L495 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-28 08:21:43,144 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:21:43,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3017 states and 3655 transitions. [2022-04-28 08:21:46,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-28 08:21:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:21:46,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:46,557 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:21:46,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:21:46,557 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-28 08:21:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571923440] [2022-04-28 08:21:46,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-04-28 08:21:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:46,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327609124] [2022-04-28 08:21:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:46,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {118334#(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); {118328#true} is VALID [2022-04-28 08:21:46,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-28 08:21:46,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-28 08:21:46,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {118328#true} call ULTIMATE.init(); {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:46,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {118334#(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); {118328#true} is VALID [2022-04-28 08:21:46,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-28 08:21:46,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-28 08:21:46,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {118328#true} call #t~ret13 := main(); {118328#true} is VALID [2022-04-28 08:21:46,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {118328#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;havoc ~cond~0; {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {118328#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {118328#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; {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {118328#true} assume !(0 != ~p1~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {118328#true} assume !(0 != ~p2~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {118328#true} assume !(0 != ~p3~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {118328#true} assume !(0 != ~p4~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {118328#true} assume !(0 != ~p5~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {118328#true} assume !(0 != ~p6~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {118328#true} assume !(0 != ~p7~0); {118328#true} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {118328#true} assume 0 != ~p8~0;~lk8~0 := 1; {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {118333#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 08:21:46,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {118333#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118329#false} is VALID [2022-04-28 08:21:46,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {118329#false} assume !false; {118329#false} is VALID [2022-04-28 08:21:46,591 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:21:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327609124] [2022-04-28 08:21:46,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327609124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:46,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571923440] [2022-04-28 08:21:46,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571923440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238363233] [2022-04-28 08:21:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:46,592 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:21:46,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:46,593 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:21:46,604 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:21:46,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:46,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:46,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:46,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:46,605 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 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:21:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:48,173 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-28 08:21:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:48,174 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:21:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:48,174 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:21:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 08:21:48,174 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:21:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 08:21:48,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-28 08:21:48,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:49,261 INFO L225 Difference]: With dead ends: 4875 [2022-04-28 08:21:49,261 INFO L226 Difference]: Without dead ends: 4873 [2022-04-28 08:21:49,262 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:21:49,264 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-28 08:21:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-28 08:21:49,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:49,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states 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:21:49,589 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states 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:21:49,591 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states 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:21:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:50,354 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-28 08:21:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-28 08:21:50,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:50,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:50,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-28 08:21:50,365 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-28 08:21:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:51,079 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-28 08:21:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-28 08:21:51,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:51,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:51,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:51,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states 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:21:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-28 08:21:52,126 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-28 08:21:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:52,126 INFO L495 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-28 08:21:52,126 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:21:52,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4617 states and 5447 transitions. [2022-04-28 08:21:57,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5447 edges. 5447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-28 08:21:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:21:57,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:57,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, 1, 1, 1, 1, 1, 1] [2022-04-28 08:21:57,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:21:57,617 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-28 08:21:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985879531] [2022-04-28 08:21:57,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-04-28 08:21:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119462381] [2022-04-28 08:21:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:57,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:57,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {147076#(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); {147070#true} is VALID [2022-04-28 08:21:57,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-28 08:21:57,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-28 08:21:57,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {147070#true} call ULTIMATE.init(); {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:57,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {147076#(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); {147070#true} is VALID [2022-04-28 08:21:57,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-28 08:21:57,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {147070#true} call #t~ret13 := main(); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {147070#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;havoc ~cond~0; {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {147070#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {147070#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; {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {147070#true} assume !(0 != ~p1~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {147070#true} assume !(0 != ~p2~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {147070#true} assume !(0 != ~p3~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {147070#true} assume !(0 != ~p4~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {147070#true} assume !(0 != ~p5~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {147070#true} assume !(0 != ~p6~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {147070#true} assume !(0 != ~p7~0); {147070#true} is VALID [2022-04-28 08:21:57,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {147070#true} assume !(0 != ~p8~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {147075#(= main_~p8~0 0)} assume 0 != ~p8~0; {147071#false} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {147071#false} assume 1 != ~lk8~0; {147071#false} is VALID [2022-04-28 08:21:57,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {147071#false} assume !false; {147071#false} is VALID [2022-04-28 08:21:57,662 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:21:57,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:57,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119462381] [2022-04-28 08:21:57,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119462381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:57,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:57,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:57,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:21:57,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985879531] [2022-04-28 08:21:57,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985879531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:57,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:21:57,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:21:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728891501] [2022-04-28 08:21:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:21:57,663 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:21:57,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:21:57,663 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:21:57,675 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:21:57,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:21:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:21:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:21:57,675 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 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:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:03,171 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-28 08:22:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:22:03,172 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:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:22:03,172 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:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:22:03,173 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:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 08:22:03,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 08:22:03,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:03,248 INFO L225 Difference]: With dead ends: 10249 [2022-04-28 08:22:03,248 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 08:22:03,261 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:03,262 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:22:03,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:22:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 08:22:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 08:22:03,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:22:03,263 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:22:03,263 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:22:03,263 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:22:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:03,263 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:22:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:22:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:03,264 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:22:03,264 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:22:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:03,264 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:22:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:22:03,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:03,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:03,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:03,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:03,264 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:22:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 08:22:03,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 08:22:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:03,264 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 08:22:03,264 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:03,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 08:22:03,264 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:22:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:22:03,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:03,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:22:03,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:22:03,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 08:22:13,917 WARN L232 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 684 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 08:22:22,596 WARN L232 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 08:22:39,245 WARN L232 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 08:23:30,717 WARN L232 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 297 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 08:23:58,642 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 08:23:58,642 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 08:23:58,642 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 08:23:58,642 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,642 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:23:58,642 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,642 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,642 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,643 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,643 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:23:58,644 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse14 (= main_~lk3~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse13 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse1 (not (= main_~p1~0 0))) (.cse2 (= main_~lk1~0 1)) (.cse10 (= main_~p8~0 0)) (.cse11 (= main_~p7~0 0)) (.cse15 (= main_~lk6~0 1)) (.cse8 (= main_~p3~0 0)) (.cse12 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse15) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse7 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse15 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse15 .cse8 .cse12))) [2022-04-28 08:23:58,644 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-04-28 08:23:58,644 INFO L895 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2022-04-28 08:23:58,644 INFO L895 garLoopResultBuilder]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse0 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse0 .cse6 .cse2 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse7) (and .cse5 .cse8 .cse1 .cse9 .cse4) (and .cse5 .cse8 .cse1 .cse9 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse7) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse1 .cse2 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse6 .cse7))) [2022-04-28 08:23:58,644 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-28 08:23:58,646 INFO L895 garLoopResultBuilder]: At program point L86-1(lines 35 132) 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:23:58,646 INFO L895 garLoopResultBuilder]: At program point L78-1(lines 35 132) 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:23:58,646 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk8~0 1)) (.cse11 (= main_~p7~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse10 (= main_~p8~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse9 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse9))) [2022-04-28 08:23:58,646 INFO L902 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-04-28 08:23:58,646 INFO L895 garLoopResultBuilder]: At program point L70-1(lines 35 132) 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:23:58,647 INFO L895 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-04-28 08:23:58,647 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-28 08:23:58,647 INFO L895 garLoopResultBuilder]: At program point L62-1(lines 35 132) 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:23:58,647 INFO L895 garLoopResultBuilder]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~p7~0 0)) (.cse2 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse1 .cse4 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse5))) [2022-04-28 08:23:58,647 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-04-28 08:23:58,647 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-04-28 08:23:58,647 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-28 08:23:58,647 INFO L895 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse6 (= main_~p7~0 0)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse7))) [2022-04-28 08:23:58,648 INFO L895 garLoopResultBuilder]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p4~0 0)) (.cse7 (= main_~p6~0 0)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse9 (= main_~p3~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse7) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse9) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse5) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse6 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse7 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse11 .cse0 .cse1 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse10 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse5 .cse9) (and .cse11 .cse1 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse5 .cse9) (and .cse8 .cse0 .cse6 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse5 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse9) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse0 .cse6 .cse4 .cse5 .cse9) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse1 .cse7 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse9) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse9) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse5) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse0 .cse6 .cse2 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse11 .cse1 .cse4 .cse10 .cse5 .cse9) (and .cse11 .cse6 .cse4 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse7) (and .cse11 .cse6 .cse4 .cse10 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-04-28 08:23:58,648 INFO L895 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-04-28 08:23:58,648 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse11 (= main_~lk7~0 1)) (.cse5 (= main_~p6~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse0 (= main_~p4~0 0)) (.cse7 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse10 (= main_~p5~0 0)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse5 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse12 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse12 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse12 .cse9 .cse6))) [2022-04-28 08:23:58,648 INFO L895 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (not (= main_~p7~0 0)))) (or (and .cse0 (= main_~p8~0 0) .cse1) (and .cse0 (= main_~lk8~0 1) .cse1))) [2022-04-28 08:23:58,649 INFO L895 garLoopResultBuilder]: At program point L82-1(lines 35 132) 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:23:58,649 INFO L895 garLoopResultBuilder]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse3) (and .cse1 .cse4 .cse5 .cse7) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7) (and .cse2 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse6 .cse7) (and .cse0 .cse4 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse1 .cse4 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse7))) [2022-04-28 08:23:58,649 INFO L895 garLoopResultBuilder]: At program point L74-1(lines 35 132) 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:23:58,649 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 35 132) 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:23:58,649 INFO L902 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-04-28 08:23:58,649 INFO L895 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 08:23:58,649 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse7 (= main_~p5~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~lk8~0 1)) (.cse3 (not (= main_~p4~0 0))) (.cse4 (= main_~lk4~0 1)) (.cse8 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse5))) [2022-04-28 08:23:58,649 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-28 08:23:58,650 INFO L895 garLoopResultBuilder]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse4 (= main_~p5~0 0)) (.cse12 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse13 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse6 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse6 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse13) (and .cse8 .cse1 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse0 .cse7 .cse11 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse13 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse13 .cse10) (and .cse11 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse13 .cse12 .cse10) (and .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse13))) [2022-04-28 08:23:58,650 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse3 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2022-04-28 08:23:58,653 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] [2022-04-28 08:23:58,654 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:23:58,657 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:23:58,662 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:23:58,807 INFO L163 areAnnotationChecker]: CFG has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:23:58,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:23:58 BoogieIcfgContainer [2022-04-28 08:23:58,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:23:58,814 INFO L158 Benchmark]: Toolchain (without parser) took 170578.63ms. Allocated memory was 176.2MB in the beginning and 974.1MB in the end (delta: 798.0MB). Free memory was 128.2MB in the beginning and 735.5MB in the end (delta: -607.3MB). Peak memory consumption was 591.0MB. Max. memory is 8.0GB. [2022-04-28 08:23:58,814 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 144.3MB in the beginning and 144.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:23:58,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.50ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 152.8MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:23:58,814 INFO L158 Benchmark]: Boogie Preprocessor took 23.07ms. Allocated memory is still 176.2MB. Free memory was 152.8MB in the beginning and 151.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 08:23:58,814 INFO L158 Benchmark]: RCFGBuilder took 416.33ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 137.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 08:23:58,815 INFO L158 Benchmark]: TraceAbstraction took 169931.90ms. Allocated memory was 176.2MB in the beginning and 974.1MB in the end (delta: 798.0MB). Free memory was 137.1MB in the beginning and 735.5MB in the end (delta: -598.4MB). Peak memory consumption was 599.6MB. Max. memory is 8.0GB. [2022-04-28 08:23:58,815 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.10ms. Allocated memory is still 176.2MB. Free memory was 144.3MB in the beginning and 144.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.50ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 152.8MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.07ms. Allocated memory is still 176.2MB. Free memory was 152.8MB in the beginning and 151.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 416.33ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 137.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 169931.90ms. Allocated memory was 176.2MB in the beginning and 974.1MB in the end (delta: 798.0MB). Free memory was 137.1MB in the beginning and 735.5MB in the end (delta: -598.4MB). Peak memory consumption was 599.6MB. 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: 135]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 169.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 115.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 58.2s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 57.0s 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: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: 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:23:58,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...