/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-e106359-m [2022-04-15 11:19:30,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:19:30,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:19:30,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:19:30,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:19:30,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:19:30,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:19:31,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:19:31,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:19:31,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:19:31,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:19:31,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:19:31,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:19:31,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:19:31,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:19:31,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:19:31,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:19:31,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:19:31,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:19:31,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:19:31,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:19:31,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:19:31,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:19:31,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:19:31,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:19:31,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:19:31,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:19:31,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:19:31,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:19:31,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:19:31,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:19:31,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:19:31,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:19:31,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:19:31,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:19:31,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:19:31,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:19:31,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:19:31,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:19:31,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:19:31,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:19:31,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:19:31,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:19:31,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:19:31,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:19:31,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:19:31,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:19:31,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:19:31,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:19:31,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:19:31,045 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:19:31,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:19:31,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:19:31,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:19:31,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:19:31,250 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:19:31,251 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-15 11:19:31,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8877de1f7/f7484fdc937d47e1b48810388b533e8e/FLAGa00136286 [2022-04-15 11:19:31,610 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:19:31,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-15 11:19:31,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8877de1f7/f7484fdc937d47e1b48810388b533e8e/FLAGa00136286 [2022-04-15 11:19:32,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8877de1f7/f7484fdc937d47e1b48810388b533e8e [2022-04-15 11:19:32,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:19:32,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:19:32,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:19:32,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:19:32,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:19:32,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481c593f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32, skipping insertion in model container [2022-04-15 11:19:32,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:19:32,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:19:32,229 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-15 11:19:32,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:19:32,244 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:19:32,301 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-15 11:19:32,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:19:32,311 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:19:32,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32 WrapperNode [2022-04-15 11:19:32,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:19:32,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:19:32,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:19:32,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:19:32,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:19:32,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:19:32,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:19:32,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:19:32,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (1/1) ... [2022-04-15 11:19:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:19:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:19:32,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:19:32,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:19:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:19:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:19:32,448 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:19:32,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:19:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:19:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:19:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:19:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:19:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:19:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:19:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:19:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:19:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:19:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:19:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:19:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:19:32,502 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:19:32,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:19:32,633 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:19:32,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:19:32,638 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:19:32,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:19:32 BoogieIcfgContainer [2022-04-15 11:19:32,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:19:32,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:19:32,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:19:32,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:19:32,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:19:32" (1/3) ... [2022-04-15 11:19:32,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c9812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:19:32, skipping insertion in model container [2022-04-15 11:19:32,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:19:32" (2/3) ... [2022-04-15 11:19:32,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c9812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:19:32, skipping insertion in model container [2022-04-15 11:19:32,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:19:32" (3/3) ... [2022-04-15 11:19:32,644 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-15 11:19:32,647 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:19:32,647 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:19:32,671 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:19:32,675 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:19:32,675 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:19:32,688 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-15 11:19:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:19:32,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:32,693 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:32,693 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-15 11:19:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996588242] [2022-04-15 11:19:32,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-04-15 11:19:32,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:32,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171019669] [2022-04-15 11:19:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:32,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:32,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:32,894 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-15 11:19:32,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 11:19:32,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-15 11:19:32,899 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-15 11:19:32,899 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-15 11:19:32,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 11:19:32,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-15 11:19:32,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-15 11:19:32,900 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-15 11:19:32,900 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-15 11:19:32,901 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-15 11:19:32,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:32,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:32,903 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-15 11:19:32,904 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-15 11:19:32,905 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-15 11:19:32,905 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-15 11:19:32,907 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-15 11:19:32,908 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-15 11:19:32,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:32,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-15 11:19:32,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 11:19:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171019669] [2022-04-15 11:19:32,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171019669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:32,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:32,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:32,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996588242] [2022-04-15 11:19:32,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996588242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:32,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:32,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:32,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939600567] [2022-04-15 11:19:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:32,921 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-15 11:19:32,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:32,924 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-15 11:19:32,948 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-15 11:19:32,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:32,968 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-15 11:19:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,222 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-15 11:19:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:33,223 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-15 11:19:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:33,224 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-15 11:19:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:19:33,231 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-15 11:19:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:19:33,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 11:19:33,341 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-15 11:19:33,349 INFO L225 Difference]: With dead ends: 76 [2022-04-15 11:19:33,349 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 11:19:33,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:33,353 INFO L913 BasicCegarLoop]: 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-15 11:19:33,353 INFO L914 BasicCegarLoop]: 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-15 11:19:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 11:19:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-15 11:19:33,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:33,377 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-15 11:19:33,378 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-15 11:19:33,378 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-15 11:19:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,382 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-15 11:19:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-15 11:19:33,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:33,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:33,383 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-15 11:19:33,383 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-15 11:19:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,387 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-15 11:19:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-15 11:19:33,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:33,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:33,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:33,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:33,388 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-15 11:19:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-15 11:19:33,391 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-15 11:19:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:33,391 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-15 11:19:33,391 INFO L479 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-15 11:19:33,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 74 transitions. [2022-04-15 11:19:33,451 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-15 11:19:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-15 11:19:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:19:33,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:33,452 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:33,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:19:33,453 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-15 11:19:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:33,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772606857] [2022-04-15 11:19:33,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-04-15 11:19:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961265638] [2022-04-15 11:19:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:33,519 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-15 11:19:33,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 11:19:33,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-15 11:19:33,520 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-15 11:19:33,521 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-15 11:19:33,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 11:19:33,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-15 11:19:33,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret13 := main(); {414#true} is VALID [2022-04-15 11:19:33,521 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-15 11:19:33,521 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-15 11:19:33,522 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-15 11:19:33,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#true} assume !(0 != ~p1~0); {419#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:33,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(= main_~p1~0 0)} assume !(0 != ~p2~0); {419#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:33,523 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-15 11:19:33,523 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-15 11:19:33,523 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-15 11:19:33,524 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-15 11:19:33,524 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-15 11:19:33,525 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-15 11:19:33,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p1~0; {415#false} is VALID [2022-04-15 11:19:33,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#false} assume 1 != ~lk1~0; {415#false} is VALID [2022-04-15 11:19:33,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 11:19:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:33,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961265638] [2022-04-15 11:19:33,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961265638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:33,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:33,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:33,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:33,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772606857] [2022-04-15 11:19:33,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772606857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:33,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:33,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161266417] [2022-04-15 11:19:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:33,528 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-15 11:19:33,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:33,528 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-15 11:19:33,554 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-15 11:19:33,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:33,555 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-15 11:19:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,706 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-15 11:19:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:33,706 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-15 11:19:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:33,707 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-15 11:19:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 11:19:33,710 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-15 11:19:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 11:19:33,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-15 11:19:33,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:33,843 INFO L225 Difference]: With dead ends: 98 [2022-04-15 11:19:33,843 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 11:19:33,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:33,847 INFO L913 BasicCegarLoop]: 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-15 11:19:33,848 INFO L914 BasicCegarLoop]: 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-15 11:19:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 11:19:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-15 11:19:33,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:33,865 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-15 11:19:33,866 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-15 11:19:33,866 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-15 11:19:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,868 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-15 11:19:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-15 11:19:33,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:33,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:33,869 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-15 11:19:33,870 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-15 11:19:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:33,872 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-15 11:19:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-15 11:19:33,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:33,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:33,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:33,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:33,873 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-15 11:19:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-15 11:19:33,875 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-15 11:19:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:33,877 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-15 11:19:33,877 INFO L479 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-15 11:19:33,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 102 transitions. [2022-04-15 11:19:33,952 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-15 11:19:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-15 11:19:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:19:33,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:33,953 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:33,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:19:33,954 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-15 11:19:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855971743] [2022-04-15 11:19:33,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-04-15 11:19:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558770854] [2022-04-15 11:19:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,024 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-15 11:19:34,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-15 11:19:34,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-15 11:19:34,025 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-15 11:19:34,028 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-15 11:19:34,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-15 11:19:34,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-15 11:19:34,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret13 := main(); {862#true} is VALID [2022-04-15 11:19:34,029 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-15 11:19:34,029 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-15 11:19:34,029 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-15 11:19:34,031 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-15 11:19:34,031 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-15 11:19:34,032 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-15 11:19:34,032 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-15 11:19:34,033 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-15 11:19:34,033 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-15 11:19:34,034 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-15 11:19:34,034 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-15 11:19:34,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {863#false} is VALID [2022-04-15 11:19:34,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#false} assume 0 != ~p2~0; {863#false} is VALID [2022-04-15 11:19:34,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#false} assume 1 != ~lk2~0; {863#false} is VALID [2022-04-15 11:19:34,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#false} assume !false; {863#false} is VALID [2022-04-15 11:19:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:34,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558770854] [2022-04-15 11:19:34,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558770854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855971743] [2022-04-15 11:19:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855971743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172094745] [2022-04-15 11:19:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:34,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:34,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:34,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:34,052 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-15 11:19:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,189 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-15 11:19:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:19:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:19:34,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 11:19:34,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:34,287 INFO L225 Difference]: With dead ends: 91 [2022-04-15 11:19:34,287 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 11:19:34,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:34,288 INFO L913 BasicCegarLoop]: 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-15 11:19:34,289 INFO L914 BasicCegarLoop]: 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-15 11:19:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 11:19:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-15 11:19:34,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:34,295 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-15 11:19:34,296 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-15 11:19:34,296 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-15 11:19:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,298 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-15 11:19:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-15 11:19:34,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:34,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:34,298 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-15 11:19:34,299 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-15 11:19:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,300 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-15 11:19:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-15 11:19:34,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:34,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:34,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:34,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:34,301 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-15 11:19:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-15 11:19:34,303 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-15 11:19:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:34,303 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-15 11:19:34,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 104 transitions. [2022-04-15 11:19:34,378 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-15 11:19:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-15 11:19:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:19:34,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:34,379 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:34,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:19:34,379 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-15 11:19:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:34,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411332763] [2022-04-15 11:19:34,380 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-04-15 11:19:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:34,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128498494] [2022-04-15 11:19:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,432 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-15 11:19:34,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-15 11:19:34,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-15 11:19:34,433 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-15 11:19:34,433 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-15 11:19:34,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-15 11:19:34,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-15 11:19:34,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret13 := main(); {1308#true} is VALID [2022-04-15 11:19:34,433 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-15 11:19:34,433 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-15 11:19:34,434 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-15 11:19:34,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(0 != ~p1~0); {1308#true} is VALID [2022-04-15 11:19:34,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !(0 != ~p2~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:34,434 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-15 11:19:34,435 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-15 11:19:34,435 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-15 11:19:34,435 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-15 11:19:34,441 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-15 11:19:34,441 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-15 11:19:34,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:34,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p2~0; {1309#false} is VALID [2022-04-15 11:19:34,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume 1 != ~lk2~0; {1309#false} is VALID [2022-04-15 11:19:34,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-15 11:19:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128498494] [2022-04-15 11:19:34,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128498494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:34,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411332763] [2022-04-15 11:19:34,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411332763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43034271] [2022-04-15 11:19:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:34,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:34,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:34,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:34,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:34,454 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-15 11:19:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,596 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-15 11:19:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:34,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-15 11:19:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-15 11:19:34,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-15 11:19:34,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:34,730 INFO L225 Difference]: With dead ends: 166 [2022-04-15 11:19:34,730 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 11:19:34,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:34,731 INFO L913 BasicCegarLoop]: 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-15 11:19:34,731 INFO L914 BasicCegarLoop]: 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-15 11:19:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 11:19:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-15 11:19:34,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:34,741 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-15 11:19:34,741 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-15 11:19:34,742 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-15 11:19:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,744 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-15 11:19:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-15 11:19:34,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:34,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:34,745 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-15 11:19:34,746 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-15 11:19:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:34,749 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-15 11:19:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-15 11:19:34,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:34,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:34,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:34,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:34,750 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-15 11:19:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-15 11:19:34,753 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-15 11:19:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:34,753 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-15 11:19:34,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:34,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 189 transitions. [2022-04-15 11:19:34,906 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-15 11:19:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-15 11:19:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:19:34,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:34,912 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:34,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:19:34,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-15 11:19:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:34,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700464232] [2022-04-15 11:19:34,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-04-15 11:19:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:34,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768054275] [2022-04-15 11:19:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:34,982 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-15 11:19:34,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-15 11:19:34,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-15 11:19:34,983 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-15 11:19:34,983 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-15 11:19:34,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-15 11:19:34,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-15 11:19:34,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret13 := main(); {2100#true} is VALID [2022-04-15 11:19:34,984 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-15 11:19:34,984 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-15 11:19:34,984 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-15 11:19:34,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#true} assume !(0 != ~p1~0); {2100#true} is VALID [2022-04-15 11:19:34,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#true} assume 0 != ~p2~0;~lk2~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:34,989 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-15 11:19:34,989 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-15 11:19:34,990 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-15 11:19:34,990 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-15 11:19:34,990 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-15 11:19:34,991 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-15 11:19:34,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2105#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:34,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2105#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:34,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2101#false} is VALID [2022-04-15 11:19:34,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-04-15 11:19:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768054275] [2022-04-15 11:19:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768054275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:34,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700464232] [2022-04-15 11:19:34,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700464232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:34,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:34,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113965828] [2022-04-15 11:19:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:34,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:34,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:35,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:35,009 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-15 11:19:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,137 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-15 11:19:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 11:19:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 11:19:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 11:19:35,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-15 11:19:35,211 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-15 11:19:35,213 INFO L225 Difference]: With dead ends: 143 [2022-04-15 11:19:35,214 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 11:19:35,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:35,214 INFO L913 BasicCegarLoop]: 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-15 11:19:35,215 INFO L914 BasicCegarLoop]: 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-15 11:19:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 11:19:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-15 11:19:35,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:35,240 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-15 11:19:35,241 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-15 11:19:35,241 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-15 11:19:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,245 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-15 11:19:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-15 11:19:35,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:35,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:35,246 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-15 11:19:35,246 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-15 11:19:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,250 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-15 11:19:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-15 11:19:35,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:35,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:35,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:35,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:35,251 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-15 11:19:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-15 11:19:35,254 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-15 11:19:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:35,254 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-15 11:19:35,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 187 transitions. [2022-04-15 11:19:35,403 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-15 11:19:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-15 11:19:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:19:35,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:35,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:35,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:19:35,404 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-15 11:19:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:35,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703217218] [2022-04-15 11:19:35,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-04-15 11:19:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:35,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857165550] [2022-04-15 11:19:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:35,442 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-15 11:19:35,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 11:19:35,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-15 11:19:35,443 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-15 11:19:35,443 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-15 11:19:35,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 11:19:35,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-15 11:19:35,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret13 := main(); {2902#true} is VALID [2022-04-15 11:19:35,443 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-15 11:19:35,444 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-15 11:19:35,444 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-15 11:19:35,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#true} assume !(0 != ~p1~0); {2902#true} is VALID [2022-04-15 11:19:35,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {2902#true} assume !(0 != ~p2~0); {2902#true} is VALID [2022-04-15 11:19:35,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#true} assume 0 != ~p3~0;~lk3~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:35,444 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-15 11:19:35,445 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-15 11:19:35,445 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-15 11:19:35,445 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-15 11:19:35,446 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-15 11:19:35,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:35,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:35,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2907#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:35,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {2907#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2903#false} is VALID [2022-04-15 11:19:35,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 11:19:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857165550] [2022-04-15 11:19:35,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857165550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:35,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:35,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:35,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703217218] [2022-04-15 11:19:35,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703217218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:35,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:35,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668596953] [2022-04-15 11:19:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:35,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:19:35,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:35,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:35,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:35,461 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-15 11:19:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,575 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-15 11:19:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:19:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 11:19:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 11:19:35,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 11:19:35,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:35,640 INFO L225 Difference]: With dead ends: 203 [2022-04-15 11:19:35,640 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 11:19:35,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:35,641 INFO L913 BasicCegarLoop]: 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-15 11:19:35,641 INFO L914 BasicCegarLoop]: 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-15 11:19:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 11:19:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-15 11:19:35,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:35,651 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-15 11:19:35,651 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-15 11:19:35,652 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-15 11:19:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,656 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-15 11:19:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-15 11:19:35,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:35,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:35,656 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-15 11:19:35,657 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-15 11:19:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:35,660 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-15 11:19:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-15 11:19:35,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:35,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:35,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:35,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:35,661 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-15 11:19:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-15 11:19:35,664 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-15 11:19:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:35,664 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-15 11:19:35,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 253 transitions. [2022-04-15 11:19:35,876 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-15 11:19:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-15 11:19:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:19:35,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:35,877 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:35,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:19:35,877 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-15 11:19:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:35,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062841063] [2022-04-15 11:19:35,879 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-04-15 11:19:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:35,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437482517] [2022-04-15 11:19:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:35,947 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-15 11:19:35,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-15 11:19:35,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-15 11:19:35,948 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-15 11:19:35,948 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-15 11:19:35,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-15 11:19:35,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-15 11:19:35,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {4024#true} call #t~ret13 := main(); {4024#true} is VALID [2022-04-15 11:19:35,948 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-15 11:19:35,948 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-15 11:19:35,949 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-15 11:19:35,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {4024#true} assume !(0 != ~p1~0); {4024#true} is VALID [2022-04-15 11:19:35,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#true} assume !(0 != ~p2~0); {4024#true} is VALID [2022-04-15 11:19:35,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#true} assume !(0 != ~p3~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:35,949 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-15 11:19:35,950 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-15 11:19:35,950 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-15 11:19:35,950 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-15 11:19:35,951 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-15 11:19:35,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:35,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:35,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p3~0; {4025#false} is VALID [2022-04-15 11:19:35,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#false} assume 1 != ~lk3~0; {4025#false} is VALID [2022-04-15 11:19:35,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-04-15 11:19:35,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-15 11:19:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:35,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437482517] [2022-04-15 11:19:35,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437482517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:35,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:35,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:35,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:35,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062841063] [2022-04-15 11:19:35,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062841063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:35,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:35,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719467204] [2022-04-15 11:19:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:19:35,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:35,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:35,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:35,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:35,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:35,965 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-15 11:19:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,106 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-15 11:19:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:36,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 11:19:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-15 11:19:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-15 11:19:36,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-15 11:19:36,213 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-15 11:19:36,216 INFO L225 Difference]: With dead ends: 351 [2022-04-15 11:19:36,216 INFO L226 Difference]: Without dead ends: 209 [2022-04-15 11:19:36,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:36,217 INFO L913 BasicCegarLoop]: 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-15 11:19:36,217 INFO L914 BasicCegarLoop]: 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-15 11:19:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-15 11:19:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-15 11:19:36,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:36,229 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-15 11:19:36,229 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-15 11:19:36,230 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-15 11:19:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,234 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-15 11:19:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-15 11:19:36,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:36,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:36,234 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-15 11:19:36,235 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-15 11:19:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,239 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-15 11:19:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-15 11:19:36,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:36,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:36,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:36,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:36,240 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-15 11:19:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-15 11:19:36,244 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-15 11:19:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:36,244 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-15 11:19:36,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 343 transitions. [2022-04-15 11:19:36,524 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-15 11:19:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-15 11:19:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:36,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:36,525 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:36,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:19:36,525 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-15 11:19:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:36,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814561296] [2022-04-15 11:19:36,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-04-15 11:19:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273660478] [2022-04-15 11:19:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:36,600 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-15 11:19:36,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 11:19:36,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-15 11:19:36,601 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-15 11:19:36,601 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-15 11:19:36,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 11:19:36,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-15 11:19:36,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret13 := main(); {5570#true} is VALID [2022-04-15 11:19:36,601 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-15 11:19:36,601 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-15 11:19:36,601 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-15 11:19:36,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#true} assume !(0 != ~p1~0); {5570#true} is VALID [2022-04-15 11:19:36,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#true} assume !(0 != ~p2~0); {5570#true} is VALID [2022-04-15 11:19:36,608 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-15 11:19:36,609 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-15 11:19:36,609 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-15 11:19:36,609 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-15 11:19:36,610 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-15 11:19:36,610 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-15 11:19:36,610 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-15 11:19:36,611 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-15 11:19:36,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5571#false} is VALID [2022-04-15 11:19:36,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {5571#false} assume 0 != ~p4~0; {5571#false} is VALID [2022-04-15 11:19:36,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#false} assume 1 != ~lk4~0; {5571#false} is VALID [2022-04-15 11:19:36,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-15 11:19:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273660478] [2022-04-15 11:19:36,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273660478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:36,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:36,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:36,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814561296] [2022-04-15 11:19:36,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814561296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:36,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:36,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652029408] [2022-04-15 11:19:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:36,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:36,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:36,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:36,625 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-15 11:19:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,743 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-15 11:19:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-15 11:19:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-15 11:19:36,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-15 11:19:36,824 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-15 11:19:36,826 INFO L225 Difference]: With dead ends: 313 [2022-04-15 11:19:36,827 INFO L226 Difference]: Without dead ends: 215 [2022-04-15 11:19:36,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:36,827 INFO L913 BasicCegarLoop]: 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-15 11:19:36,828 INFO L914 BasicCegarLoop]: 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-15 11:19:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-15 11:19:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-15 11:19:36,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:36,839 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-15 11:19:36,840 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-15 11:19:36,840 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-15 11:19:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,843 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-15 11:19:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-15 11:19:36,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:36,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:36,844 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-15 11:19:36,845 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-15 11:19:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:36,848 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-15 11:19:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-15 11:19:36,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:36,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:36,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:36,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:36,848 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-15 11:19:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-15 11:19:36,852 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-15 11:19:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:36,852 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-15 11:19:36,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:36,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 347 transitions. [2022-04-15 11:19:37,155 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-15 11:19:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-15 11:19:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:37,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:37,155 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:37,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:19:37,156 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-15 11:19:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13623806] [2022-04-15 11:19:37,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-04-15 11:19:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:37,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665994488] [2022-04-15 11:19:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:37,223 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-15 11:19:37,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-15 11:19:37,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-15 11:19:37,224 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-15 11:19:37,224 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-15 11:19:37,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-15 11:19:37,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-15 11:19:37,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call #t~ret13 := main(); {7064#true} is VALID [2022-04-15 11:19:37,224 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-15 11:19:37,224 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-15 11:19:37,224 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-15 11:19:37,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume !(0 != ~p1~0); {7064#true} is VALID [2022-04-15 11:19:37,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume !(0 != ~p2~0); {7064#true} is VALID [2022-04-15 11:19:37,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume !(0 != ~p3~0); {7064#true} is VALID [2022-04-15 11:19:37,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume 0 != ~p4~0;~lk4~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:37,225 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-15 11:19:37,226 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-15 11:19:37,227 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-15 11:19:37,227 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-15 11:19:37,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:37,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:37,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:37,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7069#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:37,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7065#false} is VALID [2022-04-15 11:19:37,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-04-15 11:19:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665994488] [2022-04-15 11:19:37,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665994488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:37,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:37,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:37,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13623806] [2022-04-15 11:19:37,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13623806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:37,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:37,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847004769] [2022-04-15 11:19:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:37,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:37,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:37,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:37,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:37,242 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-15 11:19:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:37,381 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-15 11:19:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 11:19:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 11:19:37,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-15 11:19:37,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:37,456 INFO L225 Difference]: With dead ends: 381 [2022-04-15 11:19:37,456 INFO L226 Difference]: Without dead ends: 379 [2022-04-15 11:19:37,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:37,458 INFO L913 BasicCegarLoop]: 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-15 11:19:37,458 INFO L914 BasicCegarLoop]: 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-15 11:19:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-15 11:19:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-15 11:19:37,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:37,475 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-15 11:19:37,475 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-15 11:19:37,475 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-15 11:19:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:37,485 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-15 11:19:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-15 11:19:37,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:37,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:37,486 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-15 11:19:37,486 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-15 11:19:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:37,493 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-15 11:19:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-15 11:19:37,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:37,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:37,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:37,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:37,494 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-15 11:19:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-15 11:19:37,499 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-15 11:19:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:37,499 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-15 11:19:37,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:37,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 475 transitions. [2022-04-15 11:19:37,874 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-15 11:19:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-15 11:19:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:37,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:37,875 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:37,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:19:37,875 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-15 11:19:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:37,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350292188] [2022-04-15 11:19:37,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-04-15 11:19:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:37,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400691062] [2022-04-15 11:19:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:37,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:37,923 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-15 11:19:37,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-15 11:19:37,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-15 11:19:37,932 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-15 11:19:37,932 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-15 11:19:37,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-15 11:19:37,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-15 11:19:37,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret13 := main(); {9190#true} is VALID [2022-04-15 11:19:37,932 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-15 11:19:37,932 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-15 11:19:37,932 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-15 11:19:37,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {9190#true} assume !(0 != ~p1~0); {9190#true} is VALID [2022-04-15 11:19:37,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {9190#true} assume !(0 != ~p2~0); {9190#true} is VALID [2022-04-15 11:19:37,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#true} assume !(0 != ~p3~0); {9190#true} is VALID [2022-04-15 11:19:37,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {9190#true} assume !(0 != ~p4~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:37,934 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-15 11:19:37,934 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-15 11:19:37,934 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-15 11:19:37,935 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-15 11:19:37,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:37,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:37,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:37,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p4~0; {9191#false} is VALID [2022-04-15 11:19:37,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#false} assume 1 != ~lk4~0; {9191#false} is VALID [2022-04-15 11:19:37,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2022-04-15 11:19:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:37,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:37,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400691062] [2022-04-15 11:19:37,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400691062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:37,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:37,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:37,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:37,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350292188] [2022-04-15 11:19:37,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350292188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:37,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:37,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:37,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936525804] [2022-04-15 11:19:37,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:37,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:37,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:37,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:37,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:37,951 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-15 11:19:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:38,107 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-15 11:19:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 11:19:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:19:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:19:38,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 11:19:38,205 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-15 11:19:38,215 INFO L225 Difference]: With dead ends: 685 [2022-04-15 11:19:38,215 INFO L226 Difference]: Without dead ends: 403 [2022-04-15 11:19:38,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:38,219 INFO L913 BasicCegarLoop]: 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-15 11:19:38,220 INFO L914 BasicCegarLoop]: 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-15 11:19:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-15 11:19:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-15 11:19:38,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:38,241 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-15 11:19:38,242 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-15 11:19:38,243 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-15 11:19:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:38,251 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-15 11:19:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-15 11:19:38,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:38,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:38,252 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-15 11:19:38,253 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-15 11:19:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:38,260 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-15 11:19:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-15 11:19:38,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:38,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:38,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:38,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:38,261 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-15 11:19:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-15 11:19:38,269 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-15 11:19:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:38,269 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-15 11:19:38,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 631 transitions. [2022-04-15 11:19:38,785 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-15 11:19:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-15 11:19:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:38,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:38,786 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:38,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:19:38,787 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:38,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-15 11:19:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:38,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032420328] [2022-04-15 11:19:38,787 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-04-15 11:19:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945687906] [2022-04-15 11:19:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:38,828 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-15 11:19:38,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-15 11:19:38,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-15 11:19:38,829 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-15 11:19:38,829 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-15 11:19:38,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-15 11:19:38,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-15 11:19:38,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {12180#true} call #t~ret13 := main(); {12180#true} is VALID [2022-04-15 11:19:38,829 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-15 11:19:38,829 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-15 11:19:38,829 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-15 11:19:38,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0 != ~p1~0); {12180#true} is VALID [2022-04-15 11:19:38,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0 != ~p2~0); {12180#true} is VALID [2022-04-15 11:19:38,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {12180#true} assume !(0 != ~p3~0); {12180#true} is VALID [2022-04-15 11:19:38,830 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-15 11:19:38,830 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-15 11:19:38,831 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-15 11:19:38,831 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-15 11:19:38,831 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-15 11:19:38,831 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-15 11:19:38,832 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-15 11:19:38,832 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-15 11:19:38,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12181#false} is VALID [2022-04-15 11:19:38,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {12181#false} assume 0 != ~p5~0; {12181#false} is VALID [2022-04-15 11:19:38,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {12181#false} assume 1 != ~lk5~0; {12181#false} is VALID [2022-04-15 11:19:38,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-04-15 11:19:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:38,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945687906] [2022-04-15 11:19:38,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945687906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:38,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:38,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:38,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:38,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032420328] [2022-04-15 11:19:38,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032420328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:38,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:38,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169283759] [2022-04-15 11:19:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:38,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:38,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:38,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:38,843 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-15 11:19:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:38,965 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-15 11:19:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:38,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-15 11:19:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-15 11:19:38,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-15 11:19:39,060 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-15 11:19:39,067 INFO L225 Difference]: With dead ends: 601 [2022-04-15 11:19:39,068 INFO L226 Difference]: Without dead ends: 411 [2022-04-15 11:19:39,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:39,068 INFO L913 BasicCegarLoop]: 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-15 11:19:39,069 INFO L914 BasicCegarLoop]: 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-15 11:19:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-15 11:19:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-15 11:19:39,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:39,091 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-15 11:19:39,091 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-15 11:19:39,092 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-15 11:19:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:39,099 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-15 11:19:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-15 11:19:39,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:39,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:39,100 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-15 11:19:39,100 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-15 11:19:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:39,108 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-15 11:19:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-15 11:19:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:39,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:39,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:39,109 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-15 11:19:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-15 11:19:39,117 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-15 11:19:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:39,117 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-15 11:19:39,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 409 states and 631 transitions. [2022-04-15 11:19:39,680 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-15 11:19:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-15 11:19:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:39,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:39,680 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:39,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:19:39,681 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-15 11:19:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:39,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223732545] [2022-04-15 11:19:39,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-04-15 11:19:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:39,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648211861] [2022-04-15 11:19:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:39,707 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-15 11:19:39,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-15 11:19:39,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-15 11:19:39,708 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-15 11:19:39,708 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-15 11:19:39,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-15 11:19:39,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-15 11:19:39,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {15034#true} call #t~ret13 := main(); {15034#true} is VALID [2022-04-15 11:19:39,708 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-15 11:19:39,708 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-15 11:19:39,708 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-15 11:19:39,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {15034#true} assume !(0 != ~p1~0); {15034#true} is VALID [2022-04-15 11:19:39,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {15034#true} assume !(0 != ~p2~0); {15034#true} is VALID [2022-04-15 11:19:39,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {15034#true} assume !(0 != ~p3~0); {15034#true} is VALID [2022-04-15 11:19:39,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#true} assume !(0 != ~p4~0); {15034#true} is VALID [2022-04-15 11:19:39,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#true} assume 0 != ~p5~0;~lk5~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,709 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-15 11:19:39,710 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-15 11:19:39,710 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-15 11:19:39,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15039#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:39,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {15039#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15035#false} is VALID [2022-04-15 11:19:39,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {15035#false} assume !false; {15035#false} is VALID [2022-04-15 11:19:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648211861] [2022-04-15 11:19:39,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648211861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:39,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:39,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:39,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223732545] [2022-04-15 11:19:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223732545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:39,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:39,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801257856] [2022-04-15 11:19:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:39,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:39,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:39,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:39,730 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-15 11:19:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:39,888 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-15 11:19:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:19:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:19:39,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 11:19:39,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:39,970 INFO L225 Difference]: With dead ends: 717 [2022-04-15 11:19:39,970 INFO L226 Difference]: Without dead ends: 715 [2022-04-15 11:19:39,971 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:39,971 INFO L913 BasicCegarLoop]: 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-15 11:19:39,971 INFO L914 BasicCegarLoop]: 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-15 11:19:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-15 11:19:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-15 11:19:40,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:40,003 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-15 11:19:40,003 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-15 11:19:40,004 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-15 11:19:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:40,020 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-15 11:19:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-15 11:19:40,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:40,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:40,022 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-15 11:19:40,023 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-15 11:19:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:40,039 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-15 11:19:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-15 11:19:40,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:40,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:40,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:40,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:40,041 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-15 11:19:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-15 11:19:40,065 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-15 11:19:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:40,065 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-15 11:19:40,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:40,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 879 transitions. [2022-04-15 11:19:40,840 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-15 11:19:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-15 11:19:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:40,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:40,841 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:40,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:19:40,841 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-15 11:19:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675514975] [2022-04-15 11:19:40,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-04-15 11:19:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:40,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21904824] [2022-04-15 11:19:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:40,896 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-15 11:19:40,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-15 11:19:40,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-15 11:19:40,897 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-15 11:19:40,897 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-15 11:19:40,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-15 11:19:40,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-15 11:19:40,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {19080#true} call #t~ret13 := main(); {19080#true} is VALID [2022-04-15 11:19:40,897 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-15 11:19:40,897 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-15 11:19:40,897 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-15 11:19:40,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {19080#true} assume !(0 != ~p1~0); {19080#true} is VALID [2022-04-15 11:19:40,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {19080#true} assume !(0 != ~p2~0); {19080#true} is VALID [2022-04-15 11:19:40,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {19080#true} assume !(0 != ~p3~0); {19080#true} is VALID [2022-04-15 11:19:40,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {19080#true} assume !(0 != ~p4~0); {19080#true} is VALID [2022-04-15 11:19:40,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {19080#true} assume !(0 != ~p5~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:40,899 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-15 11:19:40,900 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-15 11:19:40,901 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-15 11:19:40,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:40,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:40,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:40,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:40,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p5~0; {19081#false} is VALID [2022-04-15 11:19:40,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {19081#false} assume 1 != ~lk5~0; {19081#false} is VALID [2022-04-15 11:19:40,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {19081#false} assume !false; {19081#false} is VALID [2022-04-15 11:19:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:40,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:40,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21904824] [2022-04-15 11:19:40,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21904824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:40,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675514975] [2022-04-15 11:19:40,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675514975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:40,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:40,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925430544] [2022-04-15 11:19:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:40,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:40,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:40,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:40,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:40,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:40,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:40,918 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-15 11:19:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:41,135 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-15 11:19:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:41,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 11:19:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 11:19:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 11:19:41,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-15 11:19:41,225 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-15 11:19:41,249 INFO L225 Difference]: With dead ends: 1341 [2022-04-15 11:19:41,249 INFO L226 Difference]: Without dead ends: 779 [2022-04-15 11:19:41,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:41,250 INFO L913 BasicCegarLoop]: 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-15 11:19:41,250 INFO L914 BasicCegarLoop]: 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-15 11:19:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-15 11:19:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-15 11:19:41,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:41,294 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-15 11:19:41,295 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-15 11:19:41,295 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-15 11:19:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:41,315 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-15 11:19:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-15 11:19:41,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:41,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:41,316 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-15 11:19:41,317 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-15 11:19:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:41,336 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-15 11:19:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-15 11:19:41,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:41,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:41,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:41,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:41,338 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-15 11:19:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-15 11:19:41,384 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-15 11:19:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:41,384 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-15 11:19:41,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:41,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1143 transitions. [2022-04-15 11:19:42,432 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-15 11:19:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-15 11:19:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:42,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:42,435 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:42,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:19:42,435 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-15 11:19:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:42,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780226209] [2022-04-15 11:19:42,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-04-15 11:19:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:42,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201681701] [2022-04-15 11:19:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:42,511 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-15 11:19:42,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-15 11:19:42,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-15 11:19:42,512 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-15 11:19:42,512 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-15 11:19:42,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-15 11:19:42,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-15 11:19:42,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {24886#true} call #t~ret13 := main(); {24886#true} is VALID [2022-04-15 11:19:42,512 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-15 11:19:42,513 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-15 11:19:42,513 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-15 11:19:42,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {24886#true} assume !(0 != ~p1~0); {24886#true} is VALID [2022-04-15 11:19:42,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {24886#true} assume !(0 != ~p2~0); {24886#true} is VALID [2022-04-15 11:19:42,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {24886#true} assume !(0 != ~p3~0); {24886#true} is VALID [2022-04-15 11:19:42,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {24886#true} assume !(0 != ~p4~0); {24886#true} is VALID [2022-04-15 11:19:42,513 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-15 11:19:42,514 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-15 11:19:42,514 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-15 11:19:42,514 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-15 11:19:42,514 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-15 11:19:42,515 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-15 11:19:42,515 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-15 11:19:42,515 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-15 11:19:42,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24887#false} is VALID [2022-04-15 11:19:42,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#false} assume 0 != ~p6~0; {24887#false} is VALID [2022-04-15 11:19:42,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#false} assume 1 != ~lk6~0; {24887#false} is VALID [2022-04-15 11:19:42,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-04-15 11:19:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:42,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201681701] [2022-04-15 11:19:42,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201681701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:42,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:42,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:42,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:42,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780226209] [2022-04-15 11:19:42,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780226209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:42,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778567696] [2022-04-15 11:19:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:42,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:42,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:42,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:42,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:42,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:42,535 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-15 11:19:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:42,747 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-15 11:19:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 11:19:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 11:19:42,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 11:19:42,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:42,868 INFO L225 Difference]: With dead ends: 1165 [2022-04-15 11:19:42,868 INFO L226 Difference]: Without dead ends: 795 [2022-04-15 11:19:42,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:42,870 INFO L913 BasicCegarLoop]: 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-15 11:19:42,870 INFO L914 BasicCegarLoop]: 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-15 11:19:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-15 11:19:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-15 11:19:42,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:42,937 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-15 11:19:42,938 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-15 11:19:42,938 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-15 11:19:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:42,958 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-15 11:19:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-15 11:19:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:42,960 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-15 11:19:42,961 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-15 11:19:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:42,981 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-15 11:19:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-15 11:19:42,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:42,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:42,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:42,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:42,983 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-15 11:19:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-15 11:19:43,009 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-15 11:19:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:43,009 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-15 11:19:43,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:43,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1143 transitions. [2022-04-15 11:19:44,044 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-15 11:19:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-15 11:19:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:44,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:44,045 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:44,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:19:44,046 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-15 11:19:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654930785] [2022-04-15 11:19:44,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-04-15 11:19:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140834059] [2022-04-15 11:19:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:44,073 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-15 11:19:44,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-15 11:19:44,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-15 11:19:44,074 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-15 11:19:44,074 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-15 11:19:44,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-15 11:19:44,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-15 11:19:44,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {30404#true} call #t~ret13 := main(); {30404#true} is VALID [2022-04-15 11:19:44,074 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-15 11:19:44,075 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-15 11:19:44,075 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-15 11:19:44,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {30404#true} assume !(0 != ~p1~0); {30404#true} is VALID [2022-04-15 11:19:44,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {30404#true} assume !(0 != ~p2~0); {30404#true} is VALID [2022-04-15 11:19:44,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {30404#true} assume !(0 != ~p3~0); {30404#true} is VALID [2022-04-15 11:19:44,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {30404#true} assume !(0 != ~p4~0); {30404#true} is VALID [2022-04-15 11:19:44,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {30404#true} assume !(0 != ~p5~0); {30404#true} is VALID [2022-04-15 11:19:44,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {30404#true} assume 0 != ~p6~0;~lk6~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,076 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-15 11:19:44,076 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-15 11:19:44,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30409#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:44,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {30409#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30405#false} is VALID [2022-04-15 11:19:44,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {30405#false} assume !false; {30405#false} is VALID [2022-04-15 11:19:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:44,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140834059] [2022-04-15 11:19:44,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140834059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:44,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:44,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654930785] [2022-04-15 11:19:44,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654930785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:44,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450063359] [2022-04-15 11:19:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:44,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:44,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:44,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:44,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:44,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:44,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:44,094 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-15 11:19:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:44,345 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-15 11:19:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 11:19:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 11:19:44,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-15 11:19:44,415 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-15 11:19:44,504 INFO L225 Difference]: With dead ends: 1357 [2022-04-15 11:19:44,504 INFO L226 Difference]: Without dead ends: 1355 [2022-04-15 11:19:44,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:44,506 INFO L913 BasicCegarLoop]: 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-15 11:19:44,506 INFO L914 BasicCegarLoop]: 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-15 11:19:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-15 11:19:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-15 11:19:44,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:44,576 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-15 11:19:44,578 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-15 11:19:44,579 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-15 11:19:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:44,625 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-15 11:19:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-15 11:19:44,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:44,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:44,629 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-15 11:19:44,630 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-15 11:19:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:44,675 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-15 11:19:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-15 11:19:44,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:44,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:44,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:44,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:44,678 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-15 11:19:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-15 11:19:44,732 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-15 11:19:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:44,733 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-15 11:19:44,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:44,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1623 transitions. [2022-04-15 11:19:46,046 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-15 11:19:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-15 11:19:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:46,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:46,049 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:46,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:19:46,049 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-15 11:19:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:46,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257602368] [2022-04-15 11:19:46,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-04-15 11:19:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:46,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360819999] [2022-04-15 11:19:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:46,101 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-15 11:19:46,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-15 11:19:46,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-15 11:19:46,101 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-15 11:19:46,102 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-15 11:19:46,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-15 11:19:46,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-15 11:19:46,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {38162#true} call #t~ret13 := main(); {38162#true} is VALID [2022-04-15 11:19:46,119 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-15 11:19:46,119 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-15 11:19:46,119 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-15 11:19:46,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {38162#true} assume !(0 != ~p1~0); {38162#true} is VALID [2022-04-15 11:19:46,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {38162#true} assume !(0 != ~p2~0); {38162#true} is VALID [2022-04-15 11:19:46,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {38162#true} assume !(0 != ~p3~0); {38162#true} is VALID [2022-04-15 11:19:46,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {38162#true} assume !(0 != ~p4~0); {38162#true} is VALID [2022-04-15 11:19:46,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {38162#true} assume !(0 != ~p5~0); {38162#true} is VALID [2022-04-15 11:19:46,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {38162#true} assume !(0 != ~p6~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,121 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-15 11:19:46,121 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-15 11:19:46,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:46,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p6~0; {38163#false} is VALID [2022-04-15 11:19:46,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {38163#false} assume 1 != ~lk6~0; {38163#false} is VALID [2022-04-15 11:19:46,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {38163#false} assume !false; {38163#false} is VALID [2022-04-15 11:19:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360819999] [2022-04-15 11:19:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360819999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:46,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:46,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257602368] [2022-04-15 11:19:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257602368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:46,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445835840] [2022-04-15 11:19:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:46,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:46,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:46,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:46,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:46,138 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-15 11:19:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:46,624 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-15 11:19:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:46,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 11:19:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 11:19:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 11:19:46,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-15 11:19:46,698 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-15 11:19:46,782 INFO L225 Difference]: With dead ends: 2637 [2022-04-15 11:19:46,782 INFO L226 Difference]: Without dead ends: 1515 [2022-04-15 11:19:46,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:46,785 INFO L913 BasicCegarLoop]: 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-15 11:19:46,785 INFO L914 BasicCegarLoop]: 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-15 11:19:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-15 11:19:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-15 11:19:46,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:46,892 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-15 11:19:46,893 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-15 11:19:46,894 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-15 11:19:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:46,946 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-15 11:19:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-15 11:19:46,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:46,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:46,950 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-15 11:19:46,951 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-15 11:19:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:47,009 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-15 11:19:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-15 11:19:47,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:47,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:47,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:47,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:47,012 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-15 11:19:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-15 11:19:47,092 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-15 11:19:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:47,092 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-15 11:19:47,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:47,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1513 states and 2055 transitions. [2022-04-15 11:19:48,559 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-15 11:19:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-15 11:19:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:19:48,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:48,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:48,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:19:48,564 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-15 11:19:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814718016] [2022-04-15 11:19:48,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-04-15 11:19:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:48,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415845334] [2022-04-15 11:19:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:48,627 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-15 11:19:48,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-15 11:19:48,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-15 11:19:48,628 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-15 11:19:48,628 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-15 11:19:48,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-15 11:19:48,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-15 11:19:48,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {49504#true} call #t~ret13 := main(); {49504#true} is VALID [2022-04-15 11:19:48,628 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-15 11:19:48,628 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-15 11:19:48,628 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-15 11:19:48,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#true} assume !(0 != ~p1~0); {49504#true} is VALID [2022-04-15 11:19:48,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#true} assume !(0 != ~p2~0); {49504#true} is VALID [2022-04-15 11:19:48,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#true} assume !(0 != ~p3~0); {49504#true} is VALID [2022-04-15 11:19:48,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {49504#true} assume !(0 != ~p4~0); {49504#true} is VALID [2022-04-15 11:19:48,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {49504#true} assume !(0 != ~p5~0); {49504#true} is VALID [2022-04-15 11:19:48,629 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-15 11:19:48,629 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-15 11:19:48,629 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-15 11:19:48,629 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-15 11:19:48,630 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-15 11:19:48,630 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-15 11:19:48,630 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-15 11:19:48,630 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-15 11:19:48,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49505#false} is VALID [2022-04-15 11:19:48,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {49505#false} assume 0 != ~p7~0; {49505#false} is VALID [2022-04-15 11:19:48,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {49505#false} assume 1 != ~lk7~0; {49505#false} is VALID [2022-04-15 11:19:48,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {49505#false} assume !false; {49505#false} is VALID [2022-04-15 11:19:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415845334] [2022-04-15 11:19:48,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415845334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:48,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:48,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:48,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:48,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814718016] [2022-04-15 11:19:48,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814718016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:48,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:48,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38505762] [2022-04-15 11:19:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:48,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:48,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:48,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:48,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:48,644 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-15 11:19:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:49,018 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-15 11:19:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:19:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:19:49,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-15 11:19:49,069 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-15 11:19:49,174 INFO L225 Difference]: With dead ends: 2269 [2022-04-15 11:19:49,174 INFO L226 Difference]: Without dead ends: 1547 [2022-04-15 11:19:49,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:49,175 INFO L913 BasicCegarLoop]: 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-15 11:19:49,176 INFO L914 BasicCegarLoop]: 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-15 11:19:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-15 11:19:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-15 11:19:49,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:49,297 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-15 11:19:49,299 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-15 11:19:49,300 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-15 11:19:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:49,359 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-15 11:19:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-15 11:19:49,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:49,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:49,362 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-15 11:19:49,363 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-15 11:19:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:49,422 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-15 11:19:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-15 11:19:49,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:49,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:49,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:49,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:49,425 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-15 11:19:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-15 11:19:49,524 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-15 11:19:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:49,524 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-15 11:19:49,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:49,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2055 transitions. [2022-04-15 11:19:50,939 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-15 11:19:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-15 11:19:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:19:50,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:50,941 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:50,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:19:50,941 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-15 11:19:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:50,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575082345] [2022-04-15 11:19:50,942 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-04-15 11:19:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358024468] [2022-04-15 11:19:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:50,974 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-15 11:19:50,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-15 11:19:50,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-15 11:19:50,975 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-15 11:19:50,975 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-15 11:19:50,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-15 11:19:50,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-15 11:19:50,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {60238#true} call #t~ret13 := main(); {60238#true} is VALID [2022-04-15 11:19:50,977 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-15 11:19:50,978 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-15 11:19:50,978 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-15 11:19:50,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {60238#true} assume !(0 != ~p1~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {60238#true} assume !(0 != ~p2~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {60238#true} assume !(0 != ~p3~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {60238#true} assume !(0 != ~p4~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {60238#true} assume !(0 != ~p5~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {60238#true} assume !(0 != ~p6~0); {60238#true} is VALID [2022-04-15 11:19:50,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {60238#true} assume 0 != ~p7~0;~lk7~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,979 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-15 11:19:50,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p7~0; {60243#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:50,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {60243#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {60239#false} is VALID [2022-04-15 11:19:50,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {60239#false} assume !false; {60239#false} is VALID [2022-04-15 11:19:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:50,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358024468] [2022-04-15 11:19:50,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358024468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:50,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:50,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:50,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575082345] [2022-04-15 11:19:50,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575082345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:50,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:50,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397556514] [2022-04-15 11:19:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:50,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:50,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:50,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:50,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:50,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:50,997 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-15 11:19:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:51,513 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-15 11:19:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 11:19:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 11:19:51,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-15 11:19:51,561 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-15 11:19:51,811 INFO L225 Difference]: With dead ends: 2573 [2022-04-15 11:19:51,812 INFO L226 Difference]: Without dead ends: 2571 [2022-04-15 11:19:51,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:51,817 INFO L913 BasicCegarLoop]: 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-15 11:19:51,819 INFO L914 BasicCegarLoop]: 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-15 11:19:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-15 11:19:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-15 11:19:51,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:51,971 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-15 11:19:51,973 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-15 11:19:51,974 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-15 11:19:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:52,123 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-15 11:19:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-15 11:19:52,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:52,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:52,128 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-15 11:19:52,130 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-15 11:19:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:52,282 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-15 11:19:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-15 11:19:52,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:52,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:52,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:52,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:52,286 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-15 11:19:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-15 11:19:52,506 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-15 11:19:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:52,507 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-15 11:19:52,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:52,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 2983 transitions. [2022-04-15 11:19:55,403 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-15 11:19:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-15 11:19:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:19:55,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:55,405 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:55,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:19:55,406 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-15 11:19:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:55,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544412145] [2022-04-15 11:19:55,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-04-15 11:19:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:55,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809832443] [2022-04-15 11:19:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:55,441 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-15 11:19:55,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-15 11:19:55,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-15 11:19:55,441 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-15 11:19:55,441 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-15 11:19:55,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-15 11:19:55,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {75164#true} call #t~ret13 := main(); {75164#true} is VALID [2022-04-15 11:19:55,442 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-15 11:19:55,442 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-15 11:19:55,442 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-15 11:19:55,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {75164#true} assume !(0 != ~p1~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {75164#true} assume !(0 != ~p2~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {75164#true} assume !(0 != ~p3~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {75164#true} assume !(0 != ~p4~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {75164#true} assume !(0 != ~p5~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {75164#true} assume !(0 != ~p6~0); {75164#true} is VALID [2022-04-15 11:19:55,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {75164#true} assume !(0 != ~p7~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,443 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-15 11:19:55,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:55,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p7~0; {75165#false} is VALID [2022-04-15 11:19:55,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {75165#false} assume 1 != ~lk7~0; {75165#false} is VALID [2022-04-15 11:19:55,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {75165#false} assume !false; {75165#false} is VALID [2022-04-15 11:19:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:55,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809832443] [2022-04-15 11:19:55,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809832443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:55,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:55,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:55,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544412145] [2022-04-15 11:19:55,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544412145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:55,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:55,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839345006] [2022-04-15 11:19:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:55,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:55,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:55,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:55,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:55,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:55,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:55,460 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-15 11:19:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:56,797 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-15 11:19:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:19:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 11:19:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 11:19:56,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-15 11:19:56,890 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-15 11:19:57,214 INFO L225 Difference]: With dead ends: 5197 [2022-04-15 11:19:57,214 INFO L226 Difference]: Without dead ends: 2955 [2022-04-15 11:19:57,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:57,217 INFO L913 BasicCegarLoop]: 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-15 11:19:57,218 INFO L914 BasicCegarLoop]: 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-15 11:19:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-15 11:19:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-15 11:19:57,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:57,421 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-15 11:19:57,424 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-15 11:19:57,426 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-15 11:19:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:57,628 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-15 11:19:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-15 11:19:57,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:57,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:57,634 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-15 11:19:57,636 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-15 11:19:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:57,837 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-15 11:19:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-15 11:19:57,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:57,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:57,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:57,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:57,843 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-15 11:19:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-15 11:19:58,229 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-15 11:19:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:58,229 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-15 11:19:58,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:58,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2953 states and 3655 transitions. [2022-04-15 11:20:01,722 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-15 11:20:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-15 11:20:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:20:01,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:01,725 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:01,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:20:01,725 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-15 11:20:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145541] [2022-04-15 11:20:01,725 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-04-15 11:20:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:01,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194470549] [2022-04-15 11:20:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:01,772 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-15 11:20:01,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-15 11:20:01,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-15 11:20:01,772 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-15 11:20:01,773 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-15 11:20:01,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {97386#true} call #t~ret13 := main(); {97386#true} is VALID [2022-04-15 11:20:01,773 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-15 11:20:01,773 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-15 11:20:01,773 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-15 11:20:01,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {97386#true} assume !(0 != ~p1~0); {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {97386#true} assume !(0 != ~p2~0); {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {97386#true} assume !(0 != ~p3~0); {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {97386#true} assume !(0 != ~p4~0); {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {97386#true} assume !(0 != ~p5~0); {97386#true} is VALID [2022-04-15 11:20:01,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {97386#true} assume !(0 != ~p6~0); {97386#true} is VALID [2022-04-15 11:20:01,774 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-15 11:20:01,774 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-15 11:20:01,774 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-15 11:20:01,775 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-15 11:20:01,775 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-15 11:20:01,775 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-15 11:20:01,775 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-15 11:20:01,776 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-15 11:20:01,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97387#false} is VALID [2022-04-15 11:20:01,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {97387#false} assume 0 != ~p8~0; {97387#false} is VALID [2022-04-15 11:20:01,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {97387#false} assume 1 != ~lk8~0; {97387#false} is VALID [2022-04-15 11:20:01,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {97387#false} assume !false; {97387#false} is VALID [2022-04-15 11:20:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:01,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194470549] [2022-04-15 11:20:01,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194470549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:01,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:01,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:01,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:01,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145541] [2022-04-15 11:20:01,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:01,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:01,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281629903] [2022-04-15 11:20:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:01,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:01,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:01,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:01,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:01,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:01,791 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-15 11:20:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:02,877 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-15 11:20:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:20:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:20:02,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-15 11:20:02,966 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-15 11:20:03,293 INFO L225 Difference]: With dead ends: 4429 [2022-04-15 11:20:03,294 INFO L226 Difference]: Without dead ends: 3019 [2022-04-15 11:20:03,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:03,312 INFO L913 BasicCegarLoop]: 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-15 11:20:03,312 INFO L914 BasicCegarLoop]: 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-15 11:20:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-15 11:20:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-15 11:20:03,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:03,537 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-15 11:20:03,539 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-15 11:20:03,540 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-15 11:20:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:03,785 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-15 11:20:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-15 11:20:03,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:03,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:03,791 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-15 11:20:03,792 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-15 11:20:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:04,007 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-15 11:20:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-15 11:20:04,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:04,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:04,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:04,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:04,012 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-15 11:20:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-15 11:20:04,406 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-15 11:20:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:04,406 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-15 11:20:04,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:04,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3017 states and 3655 transitions. [2022-04-15 11:20:07,920 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-15 11:20:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-15 11:20:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:20:07,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:07,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:07,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:20:07,923 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-15 11:20:07,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:07,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213057218] [2022-04-15 11:20:07,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-04-15 11:20:07,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:07,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635645741] [2022-04-15 11:20:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:07,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:07,977 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-15 11:20:07,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-15 11:20:07,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-15 11:20:07,978 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-15 11:20:07,978 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-15 11:20:07,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-15 11:20:07,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-15 11:20:07,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {118328#true} call #t~ret13 := main(); {118328#true} is VALID [2022-04-15 11:20:07,978 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-15 11:20:07,978 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-15 11:20:07,979 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-15 11:20:07,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {118328#true} assume !(0 != ~p1~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {118328#true} assume !(0 != ~p2~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {118328#true} assume !(0 != ~p3~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {118328#true} assume !(0 != ~p4~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {118328#true} assume !(0 != ~p5~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {118328#true} assume !(0 != ~p6~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {118328#true} assume !(0 != ~p7~0); {118328#true} is VALID [2022-04-15 11:20:07,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {118328#true} assume 0 != ~p8~0;~lk8~0 := 1; {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {118333#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118333#(= main_~lk8~0 1)} is VALID [2022-04-15 11:20:07,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {118333#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118329#false} is VALID [2022-04-15 11:20:07,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {118329#false} assume !false; {118329#false} is VALID [2022-04-15 11:20:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:07,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635645741] [2022-04-15 11:20:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635645741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:07,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:07,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:07,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:07,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213057218] [2022-04-15 11:20:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213057218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:07,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:07,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486211165] [2022-04-15 11:20:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:07,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:07,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:07,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:07,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:07,993 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-15 11:20:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:09,332 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-15 11:20:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 11:20:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 11:20:09,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-15 11:20:09,365 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-15 11:20:10,274 INFO L225 Difference]: With dead ends: 4875 [2022-04-15 11:20:10,274 INFO L226 Difference]: Without dead ends: 4873 [2022-04-15 11:20:10,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:10,276 INFO L913 BasicCegarLoop]: 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-15 11:20:10,277 INFO L914 BasicCegarLoop]: 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-15 11:20:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-15 11:20:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-15 11:20:10,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:10,615 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-15 11:20:10,619 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-15 11:20:10,622 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-15 11:20:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:11,195 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-15 11:20:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-15 11:20:11,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:11,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:11,204 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-15 11:20:11,206 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-15 11:20:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:11,780 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-15 11:20:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-15 11:20:11,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:11,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:11,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:11,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:11,789 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-15 11:20:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-15 11:20:12,724 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-15 11:20:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:12,724 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-15 11:20:12,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:12,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4617 states and 5447 transitions. [2022-04-15 11:20:17,243 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-15 11:20:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-15 11:20:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:20:17,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:17,247 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:17,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:20:17,247 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-15 11:20:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232952904] [2022-04-15 11:20:17,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-04-15 11:20:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203893689] [2022-04-15 11:20:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:17,291 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-15 11:20:17,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-15 11:20:17,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-15 11:20:17,291 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-15 11:20:17,291 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-15 11:20:17,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {147070#true} call #t~ret13 := main(); {147070#true} is VALID [2022-04-15 11:20:17,292 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-15 11:20:17,292 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-15 11:20:17,292 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-15 11:20:17,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {147070#true} assume !(0 != ~p1~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {147070#true} assume !(0 != ~p2~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {147070#true} assume !(0 != ~p3~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {147070#true} assume !(0 != ~p4~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {147070#true} assume !(0 != ~p5~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {147070#true} assume !(0 != ~p6~0); {147070#true} is VALID [2022-04-15 11:20:17,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {147070#true} assume !(0 != ~p7~0); {147070#true} is VALID [2022-04-15 11:20:17,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {147070#true} assume !(0 != ~p8~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-15 11:20:17,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {147075#(= main_~p8~0 0)} assume 0 != ~p8~0; {147071#false} is VALID [2022-04-15 11:20:17,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {147071#false} assume 1 != ~lk8~0; {147071#false} is VALID [2022-04-15 11:20:17,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {147071#false} assume !false; {147071#false} is VALID [2022-04-15 11:20:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:17,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203893689] [2022-04-15 11:20:17,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203893689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:17,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:17,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:17,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:17,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232952904] [2022-04-15 11:20:17,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232952904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:17,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:17,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407689911] [2022-04-15 11:20:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:17,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:17,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:17,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:17,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:17,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:17,315 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-15 11:20:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:21,980 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-15 11:20:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:20:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:20:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:20:21,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-15 11:20:22,052 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-15 11:20:22,052 INFO L225 Difference]: With dead ends: 10249 [2022-04-15 11:20:22,052 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:20:22,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:22,090 INFO L913 BasicCegarLoop]: 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-15 11:20:22,091 INFO L914 BasicCegarLoop]: 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-15 11:20:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:20:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:20:22,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:22,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:20:22,091 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:20:22,091 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:20:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:22,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:20:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:20:22,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:22,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:22,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 11:20:22,092 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 11:20:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:22,092 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:20:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:20:22,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:22,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:22,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:22,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 11:20:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:20:22,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-15 11:20:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:22,092 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:20:22,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:22,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:20:22,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:20:22,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:22,095 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:20:22,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:20:22,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:20:32,507 WARN L232 SmtUtils]: Spent 6.42s 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-15 11:20:41,441 WARN L232 SmtUtils]: Spent 8.93s 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-15 11:20:58,180 WARN L232 SmtUtils]: Spent 8.81s 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-15 11:21:41,784 WARN L232 SmtUtils]: Spent 7.96s 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-15 11:22:03,978 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 11:22:03,978 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 11:22:03,978 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 11:22:03,978 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,978 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 11:22:03,978 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,978 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,979 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,979 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:22:03,985 INFO L878 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-15 11:22:03,985 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-04-15 11:22:03,985 INFO L878 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-15 11:22:03,985 INFO L878 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-15 11:22:03,985 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-15 11:22:03,986 INFO L878 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-15 11:22:03,986 INFO L878 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-15 11:22:03,987 INFO L878 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-15 11:22:03,987 INFO L885 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-04-15 11:22:03,987 INFO L878 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-15 11:22:03,987 INFO L878 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-04-15 11:22:03,987 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-15 11:22:03,987 INFO L878 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-15 11:22:03,987 INFO L878 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-15 11:22:03,987 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-04-15 11:22:03,987 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-04-15 11:22:03,987 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-15 11:22:03,987 INFO L878 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-15 11:22:03,988 INFO L878 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-15 11:22:03,988 INFO L878 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-04-15 11:22:03,988 INFO L878 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-15 11:22:03,988 INFO L878 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-15 11:22:03,989 INFO L878 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-15 11:22:03,989 INFO L878 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-15 11:22:03,989 INFO L878 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-15 11:22:03,989 INFO L878 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-15 11:22:03,989 INFO L885 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-04-15 11:22:03,989 INFO L878 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-15 11:22:03,989 INFO L878 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-15 11:22:03,989 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-15 11:22:03,990 INFO L878 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-15 11:22:03,990 INFO L878 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-15 11:22:03,992 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:22:04,001 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:22:04,003 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:22:04,003 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:22:04,134 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-15 11:22:04,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:22:04 BoogieIcfgContainer [2022-04-15 11:22:04,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:22:04,140 INFO L158 Benchmark]: Toolchain (without parser) took 152105.02ms. Allocated memory was 218.1MB in the beginning and 997.2MB in the end (delta: 779.1MB). Free memory was 168.6MB in the beginning and 962.5MB in the end (delta: -793.9MB). Peak memory consumption was 604.3MB. Max. memory is 8.0GB. [2022-04-15 11:22:04,140 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:22:04,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.20ms. Allocated memory is still 218.1MB. Free memory was 168.4MB in the beginning and 192.8MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 11:22:04,141 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 218.1MB. Free memory was 192.8MB in the beginning and 190.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 11:22:04,141 INFO L158 Benchmark]: RCFGBuilder took 283.03ms. Allocated memory is still 218.1MB. Free memory was 190.9MB in the beginning and 177.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:22:04,141 INFO L158 Benchmark]: TraceAbstraction took 151499.74ms. Allocated memory was 218.1MB in the beginning and 997.2MB in the end (delta: 779.1MB). Free memory was 177.3MB in the beginning and 962.5MB in the end (delta: -785.2MB). Peak memory consumption was 613.4MB. Max. memory is 8.0GB. [2022-04-15 11:22:04,146 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.20ms. Allocated memory is still 218.1MB. Free memory was 168.4MB in the beginning and 192.8MB in the end (delta: -24.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 218.1MB. Free memory was 192.8MB in the beginning and 190.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.03ms. Allocated memory is still 218.1MB. Free memory was 190.9MB in the beginning and 177.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 151499.74ms. Allocated memory was 218.1MB in the beginning and 997.2MB in the end (delta: 779.1MB). Free memory was 177.3MB in the beginning and 962.5MB in the end (delta: -785.2MB). Peak memory consumption was 613.4MB. 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: 151.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 101.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.6s 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: 6.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 56.9s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 44.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 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-15 11:22:04,180 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...