/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:56:58,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:56:58,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:56:58,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:56:58,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:56:58,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:56:58,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:56:58,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:56:58,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:56:58,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:56:58,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:56:58,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:56:58,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:56:58,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:56:58,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:56:58,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:56:58,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:56:58,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:56:58,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:56:58,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:56:58,284 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:56:58,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:56:58,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:56:58,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:56:58,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:56:58,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:56:58,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:56:58,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:56:58,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:56:58,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:56:58,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:56:58,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:56:58,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:56:58,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:56:58,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:56:58,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:56:58,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:56:58,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:56:58,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:56:58,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:56:58,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:56:58,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:56:58,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:56:58,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:56:58,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:56:58,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:56:58,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:56:58,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:56:58,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:56:58,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:56:58,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:56:58,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:56:58,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:56:58,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:56:58,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:56:58,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:56:58,311 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:56:58,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:56:58,312 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:56:58,312 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:56:58,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:56:58,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:56:58,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:56:58,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:56:58,519 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:56:58,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-08 14:56:58,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa05a9c3/2fff41d8cf4d4927bcee4825262206ed/FLAG276a76ada [2022-04-08 14:56:58,922 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:56:58,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-08 14:56:58,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa05a9c3/2fff41d8cf4d4927bcee4825262206ed/FLAG276a76ada [2022-04-08 14:56:59,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa05a9c3/2fff41d8cf4d4927bcee4825262206ed [2022-04-08 14:56:59,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:56:59,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:56:59,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:56:59,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:56:59,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:56:59,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c29f968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59, skipping insertion in model container [2022-04-08 14:56:59,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:56:59,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:56:59,555 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_14-1.c[5283,5296] [2022-04-08 14:56:59,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:56:59,572 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:56:59,617 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_14-1.c[5283,5296] [2022-04-08 14:56:59,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:56:59,626 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:56:59,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59 WrapperNode [2022-04-08 14:56:59,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:56:59,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:56:59,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:56:59,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:56:59,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:56:59,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:56:59,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:56:59,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:56:59,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (1/1) ... [2022-04-08 14:56:59,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:56:59,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:56:59,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:56:59,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:56:59,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:56:59,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:56:59,738 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:56:59,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:56:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:56:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:56:59,807 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:56:59,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:57:00,065 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:57:00,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:57:00,071 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:57:00,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:00 BoogieIcfgContainer [2022-04-08 14:57:00,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:57:00,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:57:00,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:57:00,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:57:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:59" (1/3) ... [2022-04-08 14:57:00,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab8981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:00, skipping insertion in model container [2022-04-08 14:57:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:59" (2/3) ... [2022-04-08 14:57:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab8981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:57:00, skipping insertion in model container [2022-04-08 14:57:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:57:00" (3/3) ... [2022-04-08 14:57:00,078 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-08 14:57:00,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:57:00,081 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:57:00,113 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:57:00,117 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:57:00,117 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:57:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:57:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:57:00,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:00,134 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:00,135 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-08 14:57:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:00,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347049161] [2022-04-08 14:57:00,152 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-08 14:57:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:00,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72430234] [2022-04-08 14:57:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:00,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:00,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(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(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-08 14:57:00,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-08 14:57:00,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-08 14:57:00,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:00,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(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(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-08 14:57:00,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-08 14:57:00,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-08 14:57:00,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-08 14:57:00,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-08 14:57:00,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-08 14:57:00,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-08 14:57:00,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-08 14:57:00,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-08 14:57:00,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-08 14:57:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:00,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72430234] [2022-04-08 14:57:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72430234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:00,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:00,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347049161] [2022-04-08 14:57:00,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347049161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:00,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:00,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46129783] [2022-04-08 14:57:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:00,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:00,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:00,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:00,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:00,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:00,444 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:00,803 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-08 14:57:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 14:57:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 14:57:00,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-08 14:57:00,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:00,990 INFO L225 Difference]: With dead ends: 112 [2022-04-08 14:57:00,990 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 14:57:00,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:00,994 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:00,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 14:57:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-08 14:57:01,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:01,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,021 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,021 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:01,026 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-08 14:57:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-08 14:57:01,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:01,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:01,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-08 14:57:01,027 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-08 14:57:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:01,031 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-08 14:57:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-08 14:57:01,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:01,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:01,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:01,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-08 14:57:01,035 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-08 14:57:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:01,035 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-08 14:57:01,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 122 transitions. [2022-04-08 14:57:01,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-08 14:57:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:57:01,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:01,138 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:01,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:57:01,138 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-08 14:57:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:01,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873636379] [2022-04-08 14:57:01,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 2 times [2022-04-08 14:57:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:01,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789583155] [2022-04-08 14:57:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:01,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(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(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-08 14:57:01,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-08 14:57:01,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-08 14:57:01,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:01,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(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(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-08 14:57:01,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-08 14:57:01,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-08 14:57:01,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret19 := main(); {624#true} is VALID [2022-04-08 14:57:01,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {624#true} is VALID [2022-04-08 14:57:01,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {624#true} is VALID [2022-04-08 14:57:01,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {624#true} is VALID [2022-04-08 14:57:01,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} assume !(0 != ~p1~0); {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p2~0); {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p10~0); {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-08 14:57:01,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p1~0; {625#false} is VALID [2022-04-08 14:57:01,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume 1 != ~lk1~0; {625#false} is VALID [2022-04-08 14:57:01,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-08 14:57:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789583155] [2022-04-08 14:57:01,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789583155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:01,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:01,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:01,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:01,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873636379] [2022-04-08 14:57:01,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873636379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:01,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:01,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076411059] [2022-04-08 14:57:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:01,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:01,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:01,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:01,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:01,277 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:01,546 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-08 14:57:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:57:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 14:57:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 14:57:01,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-08 14:57:01,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:01,725 INFO L225 Difference]: With dead ends: 158 [2022-04-08 14:57:01,725 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 14:57:01,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:01,728 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:01,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 14:57:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-08 14:57:01,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:01,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,747 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,748 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:01,751 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-08 14:57:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-08 14:57:01,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:01,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:01,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-08 14:57:01,753 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-08 14:57:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:01,759 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-08 14:57:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-08 14:57:01,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:01,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:01,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:01,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-08 14:57:01,763 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-08 14:57:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:01,763 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-08 14:57:01,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 174 transitions. [2022-04-08 14:57:01,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-08 14:57:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:57:01,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:01,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:01,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:57:01,896 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-08 14:57:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:01,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554985231] [2022-04-08 14:57:01,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 2 times [2022-04-08 14:57:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:01,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012124656] [2022-04-08 14:57:01,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:01,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:01,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(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(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-08 14:57:01,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-08 14:57:01,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-08 14:57:01,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:01,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(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(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-08 14:57:01,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-08 14:57:01,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-08 14:57:01,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {1336#true} call #t~ret19 := main(); {1336#true} is VALID [2022-04-08 14:57:01,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {1336#true} is VALID [2022-04-08 14:57:01,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1336#true} is VALID [2022-04-08 14:57:01,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1336#true} is VALID [2022-04-08 14:57:01,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} assume 0 != ~p1~0;~lk1~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:57:01,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1337#false} is VALID [2022-04-08 14:57:01,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#false} assume 0 != ~p2~0; {1337#false} is VALID [2022-04-08 14:57:01,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2022-04-08 14:57:01,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2022-04-08 14:57:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:01,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012124656] [2022-04-08 14:57:01,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012124656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:01,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:01,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:01,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:01,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554985231] [2022-04-08 14:57:01,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554985231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:01,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:01,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126505633] [2022-04-08 14:57:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:01,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:01,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:01,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:01,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:01,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:01,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:01,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:01,986 INFO L87 Difference]: Start difference. First operand 95 states and 174 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:02,186 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-08 14:57:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 14:57:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 14:57:02,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-08 14:57:02,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:02,370 INFO L225 Difference]: With dead ends: 145 [2022-04-08 14:57:02,370 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 14:57:02,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:02,373 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:02,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 14:57:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-08 14:57:02,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:02,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,396 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,396 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:02,399 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-08 14:57:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-08 14:57:02,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:02,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:02,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-08 14:57:02,400 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-08 14:57:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:02,403 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-08 14:57:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-08 14:57:02,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:02,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:02,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:02,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-08 14:57:02,406 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-08 14:57:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:02,407 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-08 14:57:02,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 176 transitions. [2022-04-08 14:57:02,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-08 14:57:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:57:02,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:02,536 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:02,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:57:02,538 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-08 14:57:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:02,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412405728] [2022-04-08 14:57:02,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 2 times [2022-04-08 14:57:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:02,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865084604] [2022-04-08 14:57:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:02,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:02,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#(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(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-08 14:57:02,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-08 14:57:02,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:02,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(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(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret19 := main(); {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {2034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {2034#true} is VALID [2022-04-08 14:57:02,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2034#true} is VALID [2022-04-08 14:57:02,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {2034#true} is VALID [2022-04-08 14:57:02,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#true} assume !(0 != ~p1~0); {2034#true} is VALID [2022-04-08 14:57:02,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#true} assume !(0 != ~p2~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-08 14:57:02,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p2~0; {2035#false} is VALID [2022-04-08 14:57:02,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {2035#false} assume 1 != ~lk2~0; {2035#false} is VALID [2022-04-08 14:57:02,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2022-04-08 14:57:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:02,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865084604] [2022-04-08 14:57:02,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865084604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:02,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:02,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:02,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412405728] [2022-04-08 14:57:02,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412405728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:02,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583038452] [2022-04-08 14:57:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:02,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:02,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:02,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:02,642 INFO L87 Difference]: Start difference. First operand 98 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:02,851 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-08 14:57:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 14:57:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 14:57:02,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-08 14:57:03,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:03,050 INFO L225 Difference]: With dead ends: 274 [2022-04-08 14:57:03,050 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 14:57:03,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:03,051 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:03,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 14:57:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-08 14:57:03,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:03,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,064 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,064 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:03,068 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-08 14:57:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-08 14:57:03,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:03,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-08 14:57:03,069 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-08 14:57:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:03,074 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-08 14:57:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-08 14:57:03,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:03,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:03,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:03,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-08 14:57:03,079 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-08 14:57:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:03,079 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-08 14:57:03,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 333 transitions. [2022-04-08 14:57:03,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-08 14:57:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:57:03,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:03,347 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:03,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:57:03,347 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-08 14:57:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:03,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114909346] [2022-04-08 14:57:03,348 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 2 times [2022-04-08 14:57:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:03,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988934409] [2022-04-08 14:57:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:03,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#(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(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-08 14:57:03,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-08 14:57:03,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {3330#true} call ULTIMATE.init(); {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:03,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#(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(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {3330#true} call #t~ret19 := main(); {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {3330#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {3330#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3330#true} is VALID [2022-04-08 14:57:03,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {3330#true} is VALID [2022-04-08 14:57:03,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#true} assume !(0 != ~p1~0); {3330#true} is VALID [2022-04-08 14:57:03,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#true} assume 0 != ~p2~0;~lk2~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3335#(= main_~lk2~0 1)} is VALID [2022-04-08 14:57:03,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3331#false} is VALID [2022-04-08 14:57:03,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {3331#false} assume !false; {3331#false} is VALID [2022-04-08 14:57:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:03,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988934409] [2022-04-08 14:57:03,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988934409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:03,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:03,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:03,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114909346] [2022-04-08 14:57:03,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114909346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:03,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:03,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980630079] [2022-04-08 14:57:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:03,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:03,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:03,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:03,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:03,450 INFO L87 Difference]: Start difference. First operand 183 states and 333 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:03,652 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-08 14:57:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:03,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:57:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 14:57:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-08 14:57:03,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-08 14:57:03,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:03,786 INFO L225 Difference]: With dead ends: 239 [2022-04-08 14:57:03,786 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 14:57:03,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:03,787 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:03,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 14:57:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-08 14:57:03,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:03,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,799 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,799 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:03,805 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-08 14:57:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-08 14:57:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:03,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:03,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-08 14:57:03,806 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-08 14:57:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:03,812 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-08 14:57:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-08 14:57:03,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:03,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:03,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:03,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-08 14:57:03,823 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-08 14:57:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:03,823 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-08 14:57:03,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:03,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 331 transitions. [2022-04-08 14:57:04,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-08 14:57:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:57:04,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:04,081 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:04,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:57:04,081 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-08 14:57:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269517548] [2022-04-08 14:57:04,082 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 2 times [2022-04-08 14:57:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254103357] [2022-04-08 14:57:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:04,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:04,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#(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(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-08 14:57:04,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-08 14:57:04,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-08 14:57:04,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#(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(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret19 := main(); {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {4660#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {4660#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {4660#true} is VALID [2022-04-08 14:57:04,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#true} assume !(0 != ~p1~0); {4660#true} is VALID [2022-04-08 14:57:04,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {4660#true} assume !(0 != ~p2~0); {4660#true} is VALID [2022-04-08 14:57:04,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {4660#true} assume 0 != ~p3~0;~lk3~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4665#(= main_~lk3~0 1)} is VALID [2022-04-08 14:57:04,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {4665#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4661#false} is VALID [2022-04-08 14:57:04,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2022-04-08 14:57:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254103357] [2022-04-08 14:57:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254103357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:04,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:04,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:04,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:04,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269517548] [2022-04-08 14:57:04,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269517548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:04,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:04,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377931599] [2022-04-08 14:57:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:57:04,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:04,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:04,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:04,162 INFO L87 Difference]: Start difference. First operand 183 states and 331 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:04,370 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-08 14:57:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:04,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:57:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:57:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 14:57:04,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 14:57:04,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:04,489 INFO L225 Difference]: With dead ends: 347 [2022-04-08 14:57:04,489 INFO L226 Difference]: Without dead ends: 345 [2022-04-08 14:57:04,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:04,490 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:04,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-08 14:57:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-08 14:57:04,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:04,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,515 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,516 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:04,523 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-08 14:57:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-08 14:57:04,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:04,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:04,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-08 14:57:04,524 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-08 14:57:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:04,531 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-08 14:57:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-08 14:57:04,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:04,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:04,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:04,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-08 14:57:04,538 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-08 14:57:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:04,538 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-08 14:57:04,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 445 transitions. [2022-04-08 14:57:04,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-08 14:57:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:57:04,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:04,881 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:04,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:57:04,882 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-08 14:57:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:04,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028942211] [2022-04-08 14:57:04,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 2 times [2022-04-08 14:57:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:04,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117905462] [2022-04-08 14:57:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:04,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {6556#(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(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-08 14:57:04,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-08 14:57:04,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {6550#true} call ULTIMATE.init(); {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:04,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#(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(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {6550#true} call #t~ret19 := main(); {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {6550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {6550#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6550#true} is VALID [2022-04-08 14:57:04,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {6550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {6550#true} is VALID [2022-04-08 14:57:04,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {6550#true} assume !(0 != ~p1~0); {6550#true} is VALID [2022-04-08 14:57:04,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#true} assume !(0 != ~p2~0); {6550#true} is VALID [2022-04-08 14:57:04,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {6550#true} assume !(0 != ~p3~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-08 14:57:04,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p3~0; {6551#false} is VALID [2022-04-08 14:57:04,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {6551#false} assume 1 != ~lk3~0; {6551#false} is VALID [2022-04-08 14:57:04,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-04-08 14:57:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117905462] [2022-04-08 14:57:04,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117905462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:04,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:04,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:04,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:04,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028942211] [2022-04-08 14:57:04,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028942211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:04,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:04,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941058315] [2022-04-08 14:57:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:57:04,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:04,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:04,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:04,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:04,958 INFO L87 Difference]: Start difference. First operand 247 states and 445 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:05,188 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-08 14:57:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:05,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:57:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 14:57:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 14:57:05,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-08 14:57:05,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:05,356 INFO L225 Difference]: With dead ends: 591 [2022-04-08 14:57:05,356 INFO L226 Difference]: Without dead ends: 353 [2022-04-08 14:57:05,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:05,358 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:05,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-08 14:57:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-08 14:57:05,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:05,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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-08 14:57:05,377 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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-08 14:57:05,378 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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-08 14:57:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:05,385 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-08 14:57:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-08 14:57:05,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:05,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:05,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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 353 states. [2022-04-08 14:57:05,387 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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 353 states. [2022-04-08 14:57:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:05,394 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-08 14:57:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-08 14:57:05,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:05,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:05,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:05,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 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-08 14:57:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-08 14:57:05,404 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-08 14:57:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:05,405 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-08 14:57:05,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:05,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 351 states and 631 transitions. [2022-04-08 14:57:05,911 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-08 14:57:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-08 14:57:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:57:05,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:05,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:05,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:57:05,912 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-08 14:57:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:05,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445693021] [2022-04-08 14:57:05,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 2 times [2022-04-08 14:57:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:05,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816039422] [2022-04-08 14:57:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:05,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {9158#(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(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-08 14:57:05,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 14:57:05,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-08 14:57:05,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:05,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {9158#(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(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-08 14:57:05,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 14:57:05,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-08 14:57:05,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret19 := main(); {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {9152#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 != ~p1~0); {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume !(0 != ~p2~0); {9152#true} is VALID [2022-04-08 14:57:05,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {9152#true} assume 0 != ~p3~0;~lk3~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:57:05,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9153#false} is VALID [2022-04-08 14:57:05,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {9153#false} assume 0 != ~p4~0; {9153#false} is VALID [2022-04-08 14:57:05,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {9153#false} assume 1 != ~lk4~0; {9153#false} is VALID [2022-04-08 14:57:05,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-08 14:57:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:05,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816039422] [2022-04-08 14:57:05,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816039422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:05,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:05,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445693021] [2022-04-08 14:57:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445693021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:05,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475363353] [2022-04-08 14:57:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:05,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:05,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:05,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:05,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:05,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:05,991 INFO L87 Difference]: Start difference. First operand 351 states and 631 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:06,206 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-08 14:57:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 14:57:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 14:57:06,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-08 14:57:06,387 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-08 14:57:06,394 INFO L225 Difference]: With dead ends: 529 [2022-04-08 14:57:06,394 INFO L226 Difference]: Without dead ends: 359 [2022-04-08 14:57:06,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:06,396 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:06,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-08 14:57:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-08 14:57:06,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:06,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,423 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,424 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:06,432 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-08 14:57:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-08 14:57:06,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:06,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:06,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-08 14:57:06,433 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-08 14:57:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:06,441 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-08 14:57:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-08 14:57:06,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:06,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:06,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:06,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-08 14:57:06,451 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-08 14:57:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:06,451 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-08 14:57:06,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:06,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 635 transitions. [2022-04-08 14:57:07,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-08 14:57:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:57:07,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:07,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:07,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:57:07,001 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-08 14:57:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:07,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816470237] [2022-04-08 14:57:07,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 2 times [2022-04-08 14:57:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:07,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596400767] [2022-04-08 14:57:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:07,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {11660#(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(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-08 14:57:07,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-08 14:57:07,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-08 14:57:07,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {11654#true} call ULTIMATE.init(); {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:07,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {11660#(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(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-08 14:57:07,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-08 14:57:07,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-08 14:57:07,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {11654#true} call #t~ret19 := main(); {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {11654#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {11654#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {11654#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {11654#true} assume !(0 != ~p1~0); {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {11654#true} assume !(0 != ~p2~0); {11654#true} is VALID [2022-04-08 14:57:07,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {11654#true} assume !(0 != ~p3~0); {11654#true} is VALID [2022-04-08 14:57:07,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {11654#true} assume 0 != ~p4~0;~lk4~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p4~0; {11659#(= main_~lk4~0 1)} is VALID [2022-04-08 14:57:07,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {11659#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {11655#false} is VALID [2022-04-08 14:57:07,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-04-08 14:57:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596400767] [2022-04-08 14:57:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596400767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:07,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:07,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816470237] [2022-04-08 14:57:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816470237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:07,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108844211] [2022-04-08 14:57:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:07,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:07,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:07,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:07,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:07,080 INFO L87 Difference]: Start difference. First operand 357 states and 635 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:07,295 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-08 14:57:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 14:57:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 14:57:07,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-08 14:57:07,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:07,442 INFO L225 Difference]: With dead ends: 669 [2022-04-08 14:57:07,443 INFO L226 Difference]: Without dead ends: 667 [2022-04-08 14:57:07,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:07,445 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:07,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-08 14:57:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-08 14:57:07,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:07,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,482 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,482 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:07,500 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-08 14:57:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-08 14:57:07,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:07,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:07,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-08 14:57:07,504 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-08 14:57:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:07,522 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-08 14:57:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-08 14:57:07,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:07,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:07,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:07,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-08 14:57:07,538 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-08 14:57:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:07,539 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-08 14:57:07,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 859 transitions. [2022-04-08 14:57:08,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 859 edges. 859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-08 14:57:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:57:08,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:08,266 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:08,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:57:08,266 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-08 14:57:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086854409] [2022-04-08 14:57:08,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 2 times [2022-04-08 14:57:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698859183] [2022-04-08 14:57:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:08,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {15322#(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(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-08 14:57:08,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-08 14:57:08,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-08 14:57:08,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:08,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {15322#(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(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-08 14:57:08,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret19 := main(); {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {15316#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {15316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !(0 != ~p1~0); {15316#true} is VALID [2022-04-08 14:57:08,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !(0 != ~p2~0); {15316#true} is VALID [2022-04-08 14:57:08,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !(0 != ~p3~0); {15316#true} is VALID [2022-04-08 14:57:08,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !(0 != ~p4~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p10~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p1~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p2~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p3~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-08 14:57:08,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p4~0; {15317#false} is VALID [2022-04-08 14:57:08,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {15317#false} assume 1 != ~lk4~0; {15317#false} is VALID [2022-04-08 14:57:08,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2022-04-08 14:57:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:08,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698859183] [2022-04-08 14:57:08,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698859183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:08,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:08,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:08,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:08,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086854409] [2022-04-08 14:57:08,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086854409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:08,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:08,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693871369] [2022-04-08 14:57:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:08,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:08,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:08,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:08,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:08,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:08,345 INFO L87 Difference]: Start difference. First operand 489 states and 859 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:08,632 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-08 14:57:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:57:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-08 14:57:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-08 14:57:08,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-08 14:57:08,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:08,819 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 14:57:08,819 INFO L226 Difference]: Without dead ends: 691 [2022-04-08 14:57:08,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:08,820 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:08,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-08 14:57:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-08 14:57:08,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:08,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,866 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,867 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:08,883 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-08 14:57:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-08 14:57:08,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:08,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:08,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-08 14:57:08,886 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-08 14:57:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:08,903 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-08 14:57:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-08 14:57:08,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:08,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:08,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:08,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-08 14:57:08,928 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-08 14:57:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:08,929 INFO L478 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-08 14:57:08,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:08,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 689 states and 1207 transitions. [2022-04-08 14:57:10,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-08 14:57:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:10,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:10,004 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:10,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:57:10,004 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-08 14:57:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837393674] [2022-04-08 14:57:10,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 2 times [2022-04-08 14:57:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58764492] [2022-04-08 14:57:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:10,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(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(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:10,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(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(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-08 14:57:10,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret19 := main(); {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {20418#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {20418#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {20418#true} assume !(0 != ~p1~0); {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {20418#true} assume !(0 != ~p2~0); {20418#true} is VALID [2022-04-08 14:57:10,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {20418#true} assume !(0 != ~p3~0); {20418#true} is VALID [2022-04-08 14:57:10,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {20418#true} assume 0 != ~p4~0;~lk4~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:57:10,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {20419#false} is VALID [2022-04-08 14:57:10,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {20419#false} assume 0 != ~p5~0; {20419#false} is VALID [2022-04-08 14:57:10,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {20419#false} assume 1 != ~lk5~0; {20419#false} is VALID [2022-04-08 14:57:10,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-08 14:57:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:10,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:10,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58764492] [2022-04-08 14:57:10,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58764492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:10,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:10,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:10,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:10,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837393674] [2022-04-08 14:57:10,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837393674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:10,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:10,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076833282] [2022-04-08 14:57:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:10,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:10,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:10,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:10,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:10,093 INFO L87 Difference]: Start difference. First operand 689 states and 1207 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:10,381 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-08 14:57:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-08 14:57:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-08 14:57:10,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-08 14:57:10,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:10,566 INFO L225 Difference]: With dead ends: 1033 [2022-04-08 14:57:10,566 INFO L226 Difference]: Without dead ends: 699 [2022-04-08 14:57:10,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:10,567 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:10,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:57:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-08 14:57:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-08 14:57:10,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:10,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,606 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,607 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:10,625 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-08 14:57:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-08 14:57:10,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:10,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:10,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-08 14:57:10,628 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-08 14:57:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:10,645 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-08 14:57:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-08 14:57:10,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:10,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:10,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:10,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-08 14:57:10,669 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-08 14:57:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:10,669 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-08 14:57:10,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:10,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 1207 transitions. [2022-04-08 14:57:11,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-08 14:57:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:11,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:11,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:11,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:57:11,690 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-08 14:57:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:11,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871628237] [2022-04-08 14:57:11,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 2 times [2022-04-08 14:57:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:11,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635788482] [2022-04-08 14:57:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:11,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(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(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-08 14:57:11,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-08 14:57:11,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {25288#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:11,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(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(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {25288#true} call #t~ret19 := main(); {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {25288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {25288#true} is VALID [2022-04-08 14:57:11,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {25288#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {25288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {25288#true} assume !(0 != ~p1~0); {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {25288#true} assume !(0 != ~p2~0); {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#true} assume !(0 != ~p3~0); {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {25288#true} assume !(0 != ~p4~0); {25288#true} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {25288#true} assume 0 != ~p5~0;~lk5~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p5~0; {25293#(= main_~lk5~0 1)} is VALID [2022-04-08 14:57:11,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {25293#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {25289#false} is VALID [2022-04-08 14:57:11,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {25289#false} assume !false; {25289#false} is VALID [2022-04-08 14:57:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635788482] [2022-04-08 14:57:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635788482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:11,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:11,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:11,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1871628237] [2022-04-08 14:57:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1871628237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:11,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603936012] [2022-04-08 14:57:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:11,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:11,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:11,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:11,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:11,744 INFO L87 Difference]: Start difference. First operand 697 states and 1207 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:12,044 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-08 14:57:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:57:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:57:12,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 14:57:12,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:12,217 INFO L225 Difference]: With dead ends: 1293 [2022-04-08 14:57:12,218 INFO L226 Difference]: Without dead ends: 1291 [2022-04-08 14:57:12,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:12,218 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:12,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-08 14:57:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-08 14:57:12,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:12,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,272 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,273 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:12,321 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-08 14:57:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-08 14:57:12,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:12,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:12,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-08 14:57:12,327 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-08 14:57:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:12,382 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-08 14:57:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-08 14:57:12,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:12,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:12,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:12,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-08 14:57:12,429 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-08 14:57:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:12,429 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-08 14:57:12,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:12,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1647 transitions. [2022-04-08 14:57:13,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1647 edges. 1647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-08 14:57:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:57:13,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:13,857 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:13,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:57:13,858 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-08 14:57:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:13,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10328960] [2022-04-08 14:57:13,858 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 2 times [2022-04-08 14:57:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:13,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282317044] [2022-04-08 14:57:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:13,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {32412#(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(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-08 14:57:13,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-08 14:57:13,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {32406#true} call ULTIMATE.init(); {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {32412#(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(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {32406#true} call #t~ret19 := main(); {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {32406#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {32406#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {32406#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {32406#true} assume !(0 != ~p1~0); {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {32406#true} assume !(0 != ~p2~0); {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {32406#true} assume !(0 != ~p3~0); {32406#true} is VALID [2022-04-08 14:57:13,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {32406#true} assume !(0 != ~p4~0); {32406#true} is VALID [2022-04-08 14:57:13,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {32406#true} assume !(0 != ~p5~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p10~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p1~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p2~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p3~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p4~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-08 14:57:13,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p5~0; {32407#false} is VALID [2022-04-08 14:57:13,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {32407#false} assume 1 != ~lk5~0; {32407#false} is VALID [2022-04-08 14:57:13,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {32407#false} assume !false; {32407#false} is VALID [2022-04-08 14:57:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282317044] [2022-04-08 14:57:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282317044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:13,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:13,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10328960] [2022-04-08 14:57:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10328960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:13,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:13,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719947628] [2022-04-08 14:57:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:13,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:13,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:13,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:13,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:13,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:13,914 INFO L87 Difference]: Start difference. First operand 969 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:14,425 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-08 14:57:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-08 14:57:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-08 14:57:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-08 14:57:14,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-08 14:57:14,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:14,650 INFO L225 Difference]: With dead ends: 2301 [2022-04-08 14:57:14,650 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 14:57:14,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:14,652 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:14,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 14:57:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-08 14:57:14,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:14,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,737 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,738 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:14,790 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-08 14:57:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-08 14:57:14,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:14,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:14,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 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-08 14:57:14,795 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 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-08 14:57:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:14,848 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-08 14:57:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-08 14:57:14,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:14,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:14,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:14,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-08 14:57:14,929 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-08 14:57:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:14,929 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-08 14:57:14,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:14,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 2295 transitions. [2022-04-08 14:57:16,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-08 14:57:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:57:16,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:16,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:16,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:57:16,997 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-08 14:57:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:16,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573455190] [2022-04-08 14:57:16,997 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 2 times [2022-04-08 14:57:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:16,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899978031] [2022-04-08 14:57:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:17,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {42442#(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(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-08 14:57:17,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-08 14:57:17,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-08 14:57:17,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {42436#true} call ULTIMATE.init(); {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:17,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {42442#(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(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {42436#true} call #t~ret19 := main(); {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {42436#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {42436#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {42436#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {42436#true} assume !(0 != ~p1~0); {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {42436#true} assume !(0 != ~p2~0); {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {42436#true} assume !(0 != ~p3~0); {42436#true} is VALID [2022-04-08 14:57:17,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {42436#true} assume !(0 != ~p4~0); {42436#true} is VALID [2022-04-08 14:57:17,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {42436#true} assume 0 != ~p5~0;~lk5~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:57:17,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {42437#false} is VALID [2022-04-08 14:57:17,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {42437#false} assume 0 != ~p6~0; {42437#false} is VALID [2022-04-08 14:57:17,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {42437#false} assume 1 != ~lk6~0; {42437#false} is VALID [2022-04-08 14:57:17,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {42437#false} assume !false; {42437#false} is VALID [2022-04-08 14:57:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:17,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899978031] [2022-04-08 14:57:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899978031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:17,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:17,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:17,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573455190] [2022-04-08 14:57:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573455190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:17,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:17,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346632990] [2022-04-08 14:57:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:17,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:17,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:17,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:17,056 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:17,505 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-08 14:57:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:17,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-08 14:57:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-08 14:57:17,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-08 14:57:17,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:17,723 INFO L225 Difference]: With dead ends: 2029 [2022-04-08 14:57:17,723 INFO L226 Difference]: Without dead ends: 1371 [2022-04-08 14:57:17,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:17,724 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:17,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-08 14:57:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-08 14:57:17,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:17,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,815 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,817 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:17,876 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-08 14:57:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-08 14:57:17,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:17,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:17,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-08 14:57:17,886 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-08 14:57:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:17,942 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-08 14:57:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-08 14:57:17,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:17,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:17,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:17,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-08 14:57:18,025 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-08 14:57:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:18,026 INFO L478 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-08 14:57:18,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:18,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1369 states and 2295 transitions. [2022-04-08 14:57:20,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-08 14:57:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:57:20,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:20,071 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:20,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:57:20,071 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-08 14:57:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:20,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013074597] [2022-04-08 14:57:20,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 2 times [2022-04-08 14:57:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:20,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321433987] [2022-04-08 14:57:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:20,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {51992#(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(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-08 14:57:20,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-08 14:57:20,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-08 14:57:20,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {51986#true} call ULTIMATE.init(); {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {51992#(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(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {51986#true} call #t~ret19 := main(); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {51986#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {51986#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {51986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {51986#true} assume !(0 != ~p1~0); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {51986#true} assume !(0 != ~p2~0); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {51986#true} assume !(0 != ~p3~0); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {51986#true} assume !(0 != ~p4~0); {51986#true} is VALID [2022-04-08 14:57:20,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {51986#true} assume !(0 != ~p5~0); {51986#true} is VALID [2022-04-08 14:57:20,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {51986#true} assume 0 != ~p6~0;~lk6~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p6~0; {51991#(= main_~lk6~0 1)} is VALID [2022-04-08 14:57:20,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {51991#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {51987#false} is VALID [2022-04-08 14:57:20,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {51987#false} assume !false; {51987#false} is VALID [2022-04-08 14:57:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321433987] [2022-04-08 14:57:20,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321433987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:20,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:20,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013074597] [2022-04-08 14:57:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013074597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:20,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:20,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545437641] [2022-04-08 14:57:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:20,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:20,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:20,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:20,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:20,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:20,160 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:20,763 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-08 14:57:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 14:57:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 14:57:20,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 14:57:20,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:21,134 INFO L225 Difference]: With dead ends: 2509 [2022-04-08 14:57:21,135 INFO L226 Difference]: Without dead ends: 2507 [2022-04-08 14:57:21,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:21,136 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:21,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-08 14:57:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-08 14:57:21,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:21,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:21,273 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:21,277 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:21,458 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-08 14:57:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-08 14:57:21,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:21,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:21,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-08 14:57:21,464 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-08 14:57:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:21,642 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-08 14:57:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-08 14:57:21,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:21,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:21,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:21,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-08 14:57:21,831 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-08 14:57:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:21,832 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-08 14:57:21,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:21,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 3159 transitions. [2022-04-08 14:57:24,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3159 edges. 3159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-08 14:57:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:57:24,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:24,644 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:24,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:57:24,644 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-08 14:57:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653188281] [2022-04-08 14:57:24,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 2 times [2022-04-08 14:57:24,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:24,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629499794] [2022-04-08 14:57:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:24,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {65894#(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(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-08 14:57:24,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-08 14:57:24,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-08 14:57:24,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {65888#true} call ULTIMATE.init(); {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:24,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {65894#(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(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-08 14:57:24,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {65888#true} call #t~ret19 := main(); {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {65888#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {65888#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {65888#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {65888#true} assume !(0 != ~p1~0); {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {65888#true} assume !(0 != ~p2~0); {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {65888#true} assume !(0 != ~p3~0); {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {65888#true} assume !(0 != ~p4~0); {65888#true} is VALID [2022-04-08 14:57:24,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {65888#true} assume !(0 != ~p5~0); {65888#true} is VALID [2022-04-08 14:57:24,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {65888#true} assume !(0 != ~p6~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p10~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p1~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p2~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p3~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p4~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p5~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-08 14:57:24,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p6~0; {65889#false} is VALID [2022-04-08 14:57:24,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#false} assume 1 != ~lk6~0; {65889#false} is VALID [2022-04-08 14:57:24,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#false} assume !false; {65889#false} is VALID [2022-04-08 14:57:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:24,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629499794] [2022-04-08 14:57:24,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629499794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:24,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:24,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:24,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653188281] [2022-04-08 14:57:24,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653188281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:24,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:24,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143138767] [2022-04-08 14:57:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:24,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:24,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:24,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:24,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:24,709 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:25,990 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-08 14:57:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:25,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-08 14:57:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-08 14:57:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-08 14:57:25,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-08 14:57:26,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:26,432 INFO L225 Difference]: With dead ends: 4557 [2022-04-08 14:57:26,432 INFO L226 Difference]: Without dead ends: 2667 [2022-04-08 14:57:26,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:26,435 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:26,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-08 14:57:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-08 14:57:26,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:26,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:26,606 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:26,609 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:26,853 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-08 14:57:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-08 14:57:26,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:26,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:26,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-08 14:57:26,862 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-08 14:57:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:27,076 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-08 14:57:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-08 14:57:27,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:27,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:27,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:27,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-08 14:57:27,422 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-08 14:57:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:27,423 INFO L478 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-08 14:57:27,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:27,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2665 states and 4359 transitions. [2022-04-08 14:57:31,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-08 14:57:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:57:31,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:31,638 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:31,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:57:31,638 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-08 14:57:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:31,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773739472] [2022-04-08 14:57:31,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 2 times [2022-04-08 14:57:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375121382] [2022-04-08 14:57:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:31,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:31,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#(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(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-08 14:57:31,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-08 14:57:31,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-08 14:57:31,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {85678#true} call ULTIMATE.init(); {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:31,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#(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(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {85678#true} call #t~ret19 := main(); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {85678#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {85678#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {85678#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {85678#true} assume !(0 != ~p1~0); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {85678#true} assume !(0 != ~p2~0); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {85678#true} assume !(0 != ~p3~0); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {85678#true} assume !(0 != ~p4~0); {85678#true} is VALID [2022-04-08 14:57:31,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {85678#true} assume !(0 != ~p5~0); {85678#true} is VALID [2022-04-08 14:57:31,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {85678#true} assume 0 != ~p6~0;~lk6~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:57:31,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {85679#false} is VALID [2022-04-08 14:57:31,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {85679#false} assume 0 != ~p7~0; {85679#false} is VALID [2022-04-08 14:57:31,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {85679#false} assume 1 != ~lk7~0; {85679#false} is VALID [2022-04-08 14:57:31,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {85679#false} assume !false; {85679#false} is VALID [2022-04-08 14:57:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:31,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:31,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375121382] [2022-04-08 14:57:31,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375121382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:31,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:31,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:31,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:31,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773739472] [2022-04-08 14:57:31,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773739472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:31,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:31,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:31,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557974616] [2022-04-08 14:57:31,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:31,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:31,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:31,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:31,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:31,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:31,724 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:32,954 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-08 14:57:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:32,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-08 14:57:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-08 14:57:32,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-08 14:57:33,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:33,410 INFO L225 Difference]: With dead ends: 3997 [2022-04-08 14:57:33,410 INFO L226 Difference]: Without dead ends: 2699 [2022-04-08 14:57:33,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:33,413 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:33,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-08 14:57:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-08 14:57:33,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:33,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,614 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,616 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:33,853 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-08 14:57:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-08 14:57:33,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:33,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:33,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2699 states. [2022-04-08 14:57:33,861 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2699 states. [2022-04-08 14:57:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:34,091 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-08 14:57:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-08 14:57:34,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:34,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:34,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:34,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-08 14:57:34,500 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-08 14:57:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:34,500 INFO L478 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-08 14:57:34,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:34,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2697 states and 4359 transitions. [2022-04-08 14:57:38,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-08 14:57:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:57:38,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:38,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:38,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:57:38,791 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-08 14:57:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:38,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284372033] [2022-04-08 14:57:38,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 2 times [2022-04-08 14:57:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:38,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946699656] [2022-04-08 14:57:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:38,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {104482#(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(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-08 14:57:38,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-08 14:57:38,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {104476#true} call ULTIMATE.init(); {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {104482#(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(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {104476#true} call #t~ret19 := main(); {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {104476#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {104476#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {104476#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {104476#true} assume !(0 != ~p1~0); {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {104476#true} assume !(0 != ~p2~0); {104476#true} is VALID [2022-04-08 14:57:38,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {104476#true} assume !(0 != ~p3~0); {104476#true} is VALID [2022-04-08 14:57:38,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {104476#true} assume !(0 != ~p4~0); {104476#true} is VALID [2022-04-08 14:57:38,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {104476#true} assume !(0 != ~p5~0); {104476#true} is VALID [2022-04-08 14:57:38,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {104476#true} assume !(0 != ~p6~0); {104476#true} is VALID [2022-04-08 14:57:38,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {104476#true} assume 0 != ~p7~0;~lk7~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p7~0; {104481#(= main_~lk7~0 1)} is VALID [2022-04-08 14:57:38,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {104481#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {104477#false} is VALID [2022-04-08 14:57:38,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {104477#false} assume !false; {104477#false} is VALID [2022-04-08 14:57:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:38,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:38,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946699656] [2022-04-08 14:57:38,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946699656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:38,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:38,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:38,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284372033] [2022-04-08 14:57:38,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284372033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:38,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:38,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909932881] [2022-04-08 14:57:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:38,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:38,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:38,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:38,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:38,864 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:40,495 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-08 14:57:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:40,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-08 14:57:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-08 14:57:40,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-08 14:57:40,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:41,634 INFO L225 Difference]: With dead ends: 4877 [2022-04-08 14:57:41,634 INFO L226 Difference]: Without dead ends: 4875 [2022-04-08 14:57:41,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:41,636 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:41,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-08 14:57:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-08 14:57:41,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:41,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:41,907 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:41,910 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:42,617 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-08 14:57:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-08 14:57:42,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:42,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:42,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-08 14:57:42,628 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-08 14:57:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:43,340 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-08 14:57:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-08 14:57:43,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:43,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:43,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:43,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-08 14:57:44,072 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-08 14:57:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:44,072 INFO L478 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-08 14:57:44,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:44,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3849 states and 6055 transitions. [2022-04-08 14:57:49,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6055 edges. 6055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-08 14:57:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 14:57:49,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:49,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:49,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:57:49,880 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-08 14:57:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587565525] [2022-04-08 14:57:49,881 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 2 times [2022-04-08 14:57:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:49,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037517053] [2022-04-08 14:57:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:49,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {131696#(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(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-08 14:57:49,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-08 14:57:49,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {131690#true} call ULTIMATE.init(); {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:49,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {131696#(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(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {131690#true} call #t~ret19 := main(); {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {131690#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {131690#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {131690#true} is VALID [2022-04-08 14:57:49,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {131690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {131690#true} assume !(0 != ~p1~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {131690#true} assume !(0 != ~p2~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {131690#true} assume !(0 != ~p3~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {131690#true} assume !(0 != ~p4~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {131690#true} assume !(0 != ~p5~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {131690#true} assume !(0 != ~p6~0); {131690#true} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {131690#true} assume !(0 != ~p7~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p10~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p1~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p2~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p3~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p4~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p5~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p6~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-08 14:57:49,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p7~0; {131691#false} is VALID [2022-04-08 14:57:49,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {131691#false} assume 1 != ~lk7~0; {131691#false} is VALID [2022-04-08 14:57:49,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {131691#false} assume !false; {131691#false} is VALID [2022-04-08 14:57:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037517053] [2022-04-08 14:57:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037517053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:49,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:49,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587565525] [2022-04-08 14:57:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587565525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:49,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045633252] [2022-04-08 14:57:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:49,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:49,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:49,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:49,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:49,943 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:54,376 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-08 14:57:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 14:57:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-08 14:57:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-08 14:57:54,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-08 14:57:54,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:55,624 INFO L225 Difference]: With dead ends: 9037 [2022-04-08 14:57:55,624 INFO L226 Difference]: Without dead ends: 5259 [2022-04-08 14:57:55,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:55,629 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:55,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-08 14:57:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-08 14:57:56,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:56,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:56,044 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:56,048 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:56,856 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-08 14:57:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-08 14:57:56,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:56,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:56,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5259 states. [2022-04-08 14:57:56,872 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5259 states. [2022-04-08 14:57:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:57,686 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-08 14:57:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-08 14:57:57,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:57,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:57,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:57,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-08 14:57:59,042 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-08 14:57:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:59,043 INFO L478 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-08 14:57:59,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:59,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5257 states and 8263 transitions. [2022-04-08 14:58:07,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-08 14:58:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:07,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:07,569 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:07,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:58:07,569 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-08 14:58:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:07,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496591206] [2022-04-08 14:58:07,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 2 times [2022-04-08 14:58:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:07,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070659482] [2022-04-08 14:58:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:07,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {170814#(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(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-08 14:58:07,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-08 14:58:07,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {170808#true} call ULTIMATE.init(); {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {170814#(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(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {170808#true} call #t~ret19 := main(); {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {170808#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {170808#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {170808#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {170808#true} assume !(0 != ~p1~0); {170808#true} is VALID [2022-04-08 14:58:07,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {170808#true} assume !(0 != ~p2~0); {170808#true} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {170808#true} assume !(0 != ~p3~0); {170808#true} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {170808#true} assume !(0 != ~p4~0); {170808#true} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {170808#true} assume !(0 != ~p5~0); {170808#true} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {170808#true} assume !(0 != ~p6~0); {170808#true} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {170808#true} assume 0 != ~p7~0;~lk7~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:58:07,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {170809#false} is VALID [2022-04-08 14:58:07,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {170809#false} assume 0 != ~p8~0; {170809#false} is VALID [2022-04-08 14:58:07,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {170809#false} assume 1 != ~lk8~0; {170809#false} is VALID [2022-04-08 14:58:07,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {170809#false} assume !false; {170809#false} is VALID [2022-04-08 14:58:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:07,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070659482] [2022-04-08 14:58:07,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070659482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:07,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:07,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:07,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:07,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496591206] [2022-04-08 14:58:07,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496591206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:07,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:07,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327492039] [2022-04-08 14:58:07,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:58:07,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:07,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:07,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:07,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:07,650 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:11,221 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-08 14:58:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:58:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-08 14:58:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-08 14:58:11,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-08 14:58:11,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:12,496 INFO L225 Difference]: With dead ends: 7885 [2022-04-08 14:58:12,496 INFO L226 Difference]: Without dead ends: 5323 [2022-04-08 14:58:12,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:58:12,499 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:12,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-08 14:58:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-08 14:58:12,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:12,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:12,925 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:12,930 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:13,851 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-08 14:58:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-08 14:58:13,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:13,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:13,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-08 14:58:13,867 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-08 14:58:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:14,784 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-08 14:58:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-08 14:58:14,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:14,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:14,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:14,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-08 14:58:16,118 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-08 14:58:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:16,118 INFO L478 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-08 14:58:16,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:16,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5321 states and 8263 transitions. [2022-04-08 14:58:24,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-08 14:58:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:24,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:24,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:24,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 14:58:24,566 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-08 14:58:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:24,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705974011] [2022-04-08 14:58:24,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 2 times [2022-04-08 14:58:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:24,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980844853] [2022-04-08 14:58:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:24,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {207884#(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(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-08 14:58:24,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-08 14:58:24,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-08 14:58:24,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {207878#true} call ULTIMATE.init(); {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:24,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {207884#(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(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {207878#true} call #t~ret19 := main(); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {207878#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {207878#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {207878#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {207878#true} assume !(0 != ~p1~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {207878#true} assume !(0 != ~p2~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {207878#true} assume !(0 != ~p3~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {207878#true} assume !(0 != ~p4~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {207878#true} assume !(0 != ~p5~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {207878#true} assume !(0 != ~p6~0); {207878#true} is VALID [2022-04-08 14:58:24,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {207878#true} assume !(0 != ~p7~0); {207878#true} is VALID [2022-04-08 14:58:24,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {207878#true} assume 0 != ~p8~0;~lk8~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p8~0; {207883#(= main_~lk8~0 1)} is VALID [2022-04-08 14:58:24,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {207883#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {207879#false} is VALID [2022-04-08 14:58:24,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {207879#false} assume !false; {207879#false} is VALID [2022-04-08 14:58:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980844853] [2022-04-08 14:58:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980844853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:24,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:24,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:24,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705974011] [2022-04-08 14:58:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705974011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:24,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:24,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458999904] [2022-04-08 14:58:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:58:24,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:24,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:24,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:24,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:24,644 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:29,820 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-08 14:58:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:58:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:58:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:58:29,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 14:58:29,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:33,654 INFO L225 Difference]: With dead ends: 9485 [2022-04-08 14:58:33,654 INFO L226 Difference]: Without dead ends: 9483 [2022-04-08 14:58:33,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:58:33,656 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:33,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-08 14:58:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-08 14:58:34,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:34,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:34,299 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:34,306 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:37,075 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-08 14:58:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-08 14:58:37,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:37,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:37,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-08 14:58:37,098 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-08 14:58:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:39,774 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-08 14:58:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-08 14:58:39,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:39,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:39,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:39,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-08 14:58:42,654 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-08 14:58:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:42,654 INFO L478 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-08 14:58:42,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:42,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7689 states and 11591 transitions. [2022-04-08 14:58:54,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11591 edges. 11591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-08 14:58:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 14:58:54,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:54,471 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:54,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 14:58:54,471 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-08 14:58:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70859966] [2022-04-08 14:58:54,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 2 times [2022-04-08 14:58:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:54,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338799388] [2022-04-08 14:58:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:54,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:54,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {261210#(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(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {261204#true} call ULTIMATE.init(); {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:54,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {261210#(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(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {261204#true} call #t~ret19 := main(); {261204#true} is VALID [2022-04-08 14:58:54,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {261204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {261204#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {261204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {261204#true} assume !(0 != ~p1~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {261204#true} assume !(0 != ~p2~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {261204#true} assume !(0 != ~p3~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {261204#true} assume !(0 != ~p4~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {261204#true} assume !(0 != ~p5~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {261204#true} assume !(0 != ~p6~0); {261204#true} is VALID [2022-04-08 14:58:54,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {261204#true} assume !(0 != ~p7~0); {261204#true} is VALID [2022-04-08 14:58:54,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {261204#true} assume !(0 != ~p8~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p10~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p1~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p2~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p3~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p4~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p5~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p6~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p7~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-08 14:58:54,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p8~0; {261205#false} is VALID [2022-04-08 14:58:54,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {261205#false} assume 1 != ~lk8~0; {261205#false} is VALID [2022-04-08 14:58:54,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {261205#false} assume !false; {261205#false} is VALID [2022-04-08 14:58:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338799388] [2022-04-08 14:58:54,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338799388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70859966] [2022-04-08 14:58:54,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70859966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:54,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:54,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681442861] [2022-04-08 14:58:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:58:54,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:54,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:54,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:54,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:54,538 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:11,205 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-08 14:59:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 14:59:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-08 14:59:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-08 14:59:11,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-08 14:59:11,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:15,624 INFO L225 Difference]: With dead ends: 17933 [2022-04-08 14:59:15,624 INFO L226 Difference]: Without dead ends: 10379 [2022-04-08 14:59:15,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:15,632 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:15,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:59:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-08 14:59:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-08 14:59:16,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:16,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,447 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,457 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:19,632 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-08 14:59:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-08 14:59:19,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:19,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:19,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-08 14:59:19,662 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-08 14:59:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:22,947 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-08 14:59:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-08 14:59:22,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:22,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:22,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:22,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-08 14:59:28,085 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-08 14:59:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:28,086 INFO L478 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-08 14:59:28,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:28,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10377 states and 15623 transitions. [2022-04-08 14:59:44,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-08 14:59:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 14:59:44,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:44,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:44,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 14:59:44,673 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-08 14:59:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:44,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366888832] [2022-04-08 14:59:44,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 2 times [2022-04-08 14:59:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:44,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126171119] [2022-04-08 14:59:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:44,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {338600#(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(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-08 14:59:44,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-08 14:59:44,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-08 14:59:44,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {338594#true} call ULTIMATE.init(); {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:44,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {338600#(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(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-08 14:59:44,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-08 14:59:44,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-08 14:59:44,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {338594#true} call #t~ret19 := main(); {338594#true} is VALID [2022-04-08 14:59:44,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {338594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {338594#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {338594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {338594#true} assume !(0 != ~p1~0); {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {338594#true} assume !(0 != ~p2~0); {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {338594#true} assume !(0 != ~p3~0); {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {338594#true} assume !(0 != ~p4~0); {338594#true} is VALID [2022-04-08 14:59:44,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {338594#true} assume !(0 != ~p5~0); {338594#true} is VALID [2022-04-08 14:59:44,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {338594#true} assume !(0 != ~p6~0); {338594#true} is VALID [2022-04-08 14:59:44,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {338594#true} assume !(0 != ~p7~0); {338594#true} is VALID [2022-04-08 14:59:44,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {338594#true} assume 0 != ~p8~0;~lk8~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:59:44,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {338595#false} is VALID [2022-04-08 14:59:44,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {338595#false} assume 0 != ~p9~0; {338595#false} is VALID [2022-04-08 14:59:44,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {338595#false} assume 1 != ~lk9~0; {338595#false} is VALID [2022-04-08 14:59:44,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {338595#false} assume !false; {338595#false} is VALID [2022-04-08 14:59:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:59:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126171119] [2022-04-08 14:59:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126171119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:44,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:44,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:44,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366888832] [2022-04-08 14:59:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366888832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:44,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125382225] [2022-04-08 14:59:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 14:59:44,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:44,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:44,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:44,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:44,746 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:57,755 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-08 14:59:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 14:59:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-08 14:59:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-08 14:59:57,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-08 14:59:57,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:02,247 INFO L225 Difference]: With dead ends: 15565 [2022-04-08 15:00:02,247 INFO L226 Difference]: Without dead ends: 10507 [2022-04-08 15:00:02,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:00:02,253 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:00:02,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:00:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-08 15:00:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-08 15:00:03,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:00:03,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:03,094 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:03,106 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:06,461 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-08 15:00:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-08 15:00:06,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:06,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:06,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-08 15:00:06,492 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-08 15:00:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:09,889 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-08 15:00:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-08 15:00:09,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:09,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:09,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:00:09,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:00:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-08 15:00:15,230 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-08 15:00:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:00:15,231 INFO L478 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-08 15:00:15,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:15,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10505 states and 15623 transitions. [2022-04-08 15:00:31,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-08 15:00:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 15:00:31,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:00:31,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:00:31,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:00:31,941 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:00:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:00:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-08 15:00:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127824063] [2022-04-08 15:00:31,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:00:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 2 times [2022-04-08 15:00:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:00:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566493756] [2022-04-08 15:00:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:00:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:00:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:00:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:31,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {411766#(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(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-08 15:00:31,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-08 15:00:31,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-08 15:00:31,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {411760#true} call ULTIMATE.init(); {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:00:31,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {411766#(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(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-08 15:00:31,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-08 15:00:31,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {411760#true} call #t~ret19 := main(); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {411760#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {411760#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {411760#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {411760#true} assume !(0 != ~p1~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {411760#true} assume !(0 != ~p2~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {411760#true} assume !(0 != ~p3~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {411760#true} assume !(0 != ~p4~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {411760#true} assume !(0 != ~p5~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {411760#true} assume !(0 != ~p6~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {411760#true} assume !(0 != ~p7~0); {411760#true} is VALID [2022-04-08 15:00:31,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {411760#true} assume !(0 != ~p8~0); {411760#true} is VALID [2022-04-08 15:00:31,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {411760#true} assume 0 != ~p9~0;~lk9~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p9~0; {411765#(= main_~lk9~0 1)} is VALID [2022-04-08 15:00:31,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {411765#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {411761#false} is VALID [2022-04-08 15:00:31,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {411761#false} assume !false; {411761#false} is VALID [2022-04-08 15:00:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:00:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:00:31,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566493756] [2022-04-08 15:00:31,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566493756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:31,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:31,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:31,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:00:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127824063] [2022-04-08 15:00:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127824063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:31,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:31,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262321937] [2022-04-08 15:00:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:00:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 15:00:31,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:00:31,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:32,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:32,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:00:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:00:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:00:32,016 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:51,161 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-08 15:00:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:00:51,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 15:00:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:00:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 15:00:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 15:00:51,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 15:00:51,254 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-08 15:01:06,036 INFO L225 Difference]: With dead ends: 18445 [2022-04-08 15:01:06,037 INFO L226 Difference]: Without dead ends: 18443 [2022-04-08 15:01:06,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:01:06,040 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:01:06,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:01:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-08 15:01:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-08 15:01:07,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:01:07,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:07,320 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:07,336 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:17,537 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-08 15:01:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-08 15:01:17,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:17,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:17,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-08 15:01:17,581 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-08 15:01:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:27,546 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-08 15:01:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-08 15:01:27,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:27,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:27,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:01:27,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:01:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-08 15:01:39,379 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-08 15:01:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:01:39,379 INFO L478 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-08 15:01:39,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:39,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15369 states and 22151 transitions. [2022-04-08 15:02:02,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22151 edges. 22151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-08 15:02:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 15:02:02,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:02:02,966 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:02:02,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:02:02,966 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:02:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:02:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-08 15:02:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196080930] [2022-04-08 15:02:02,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:02:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 2 times [2022-04-08 15:02:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:02:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323956300] [2022-04-08 15:02:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:02:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:02:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:02:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:02,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {516292#(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(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-08 15:02:02,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {516286#true} call ULTIMATE.init(); {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:02:02,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {516292#(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(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {516286#true} call #t~ret19 := main(); {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {516286#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {516286#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {516286#true} is VALID [2022-04-08 15:02:02,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {516286#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {516286#true} assume !(0 != ~p1~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {516286#true} assume !(0 != ~p2~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {516286#true} assume !(0 != ~p3~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {516286#true} assume !(0 != ~p4~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {516286#true} assume !(0 != ~p5~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {516286#true} assume !(0 != ~p6~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {516286#true} assume !(0 != ~p7~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {516286#true} assume !(0 != ~p8~0); {516286#true} is VALID [2022-04-08 15:02:03,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {516286#true} assume !(0 != ~p9~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p10~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p1~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p2~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p3~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p4~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p5~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p6~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p7~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p8~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-08 15:02:03,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p9~0; {516287#false} is VALID [2022-04-08 15:02:03,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {516287#false} assume 1 != ~lk9~0; {516287#false} is VALID [2022-04-08 15:02:03,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {516287#false} assume !false; {516287#false} is VALID [2022-04-08 15:02:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:02:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:02:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323956300] [2022-04-08 15:02:03,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323956300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:03,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:03,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:02:03,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:02:03,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196080930] [2022-04-08 15:02:03,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196080930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:03,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:03,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:02:03,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714454889] [2022-04-08 15:02:03,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:02:03,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 15:02:03,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:02:03,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:03,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:03,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:02:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:03,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:02:03,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:02:03,022 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:36,066 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-08 15:03:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:03:36,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 15:03:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:03:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-08 15:03:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-08 15:03:36,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-08 15:03:36,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:53,558 INFO L225 Difference]: With dead ends: 35597 [2022-04-08 15:03:53,558 INFO L226 Difference]: Without dead ends: 20491 [2022-04-08 15:03:53,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:03:53,576 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:03:53,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:03:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-08 15:03:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-08 15:03:55,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:03:55,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:55,416 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:03:55,441 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:04:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:08,038 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-08 15:04:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-08 15:04:08,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:08,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:08,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-08 15:04:08,105 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-08 15:04:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:21,028 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-08 15:04:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-08 15:04:21,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:21,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:21,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:04:21,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:04:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:04:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-08 15:04:41,882 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-08 15:04:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:04:41,882 INFO L478 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-08 15:04:41,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:04:41,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20489 states and 29447 transitions. [2022-04-08 15:05:14,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:05:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-08 15:05:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:05:14,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:05:14,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:05:14,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:05:14,814 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:05:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:05:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-08 15:05:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:05:14,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133127311] [2022-04-08 15:05:14,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:05:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 2 times [2022-04-08 15:05:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:05:14,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290140198] [2022-04-08 15:05:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:05:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:05:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:05:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:14,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {669458#(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(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {669452#true} call ULTIMATE.init(); {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:05:14,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {669458#(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(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-08 15:05:14,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {669452#true} call #t~ret19 := main(); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {669452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {669452#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {669452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {669452#true} assume !(0 != ~p1~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {669452#true} assume !(0 != ~p2~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {669452#true} assume !(0 != ~p3~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {669452#true} assume !(0 != ~p4~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {669452#true} assume !(0 != ~p5~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {669452#true} assume !(0 != ~p6~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {669452#true} assume !(0 != ~p7~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {669452#true} assume !(0 != ~p8~0); {669452#true} is VALID [2022-04-08 15:05:14,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {669452#true} assume 0 != ~p9~0;~lk9~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {669453#false} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {669453#false} assume 0 != ~p10~0; {669453#false} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {669453#false} assume 1 != ~lk10~0; {669453#false} is VALID [2022-04-08 15:05:14,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {669453#false} assume !false; {669453#false} is VALID [2022-04-08 15:05:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:05:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:05:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290140198] [2022-04-08 15:05:14,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290140198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:05:14,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:05:14,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:05:14,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:05:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133127311] [2022-04-08 15:05:14,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133127311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:05:14,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:05:14,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:05:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990401525] [2022-04-08 15:05:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:05:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 15:05:14,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:05:14,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:05:14,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:05:14,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:05:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:05:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:05:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:05:14,875 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:13,402 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-08 15:06:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:06:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 15:06:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:06:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-08 15:06:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-08 15:06:13,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-08 15:06:13,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:06:31,387 INFO L225 Difference]: With dead ends: 30733 [2022-04-08 15:06:31,388 INFO L226 Difference]: Without dead ends: 20747 [2022-04-08 15:06:31,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:06:31,402 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:06:31,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:06:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-08 15:06:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-08 15:06:33,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:06:33,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:33,281 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:33,305 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:45,716 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-08 15:06:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-08 15:06:45,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:06:45,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:06:45,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-08 15:06:45,778 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-08 15:06:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:58,227 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-08 15:06:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-08 15:06:58,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:06:58,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:06:58,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:06:58,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:06:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-08 15:07:19,596 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-08 15:07:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:07:19,596 INFO L478 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-08 15:07:19,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:19,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20745 states and 29447 transitions. [2022-04-08 15:07:52,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-08 15:07:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:07:52,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:07:52,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:07:52,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:07:52,391 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:07:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:07:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-08 15:07:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:07:52,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381036720] [2022-04-08 15:07:52,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:07:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 2 times [2022-04-08 15:07:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:07:52,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099634913] [2022-04-08 15:07:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:07:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:07:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:52,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:07:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:52,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {813920#(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(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {813914#true} call ULTIMATE.init(); {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:07:52,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {813920#(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(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {813914#true} call #t~ret19 := main(); {813914#true} is VALID [2022-04-08 15:07:52,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {813914#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {813914#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {813914#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {813914#true} assume !(0 != ~p1~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {813914#true} assume !(0 != ~p2~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {813914#true} assume !(0 != ~p3~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {813914#true} assume !(0 != ~p4~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {813914#true} assume !(0 != ~p5~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {813914#true} assume !(0 != ~p6~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {813914#true} assume !(0 != ~p7~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {813914#true} assume !(0 != ~p8~0); {813914#true} is VALID [2022-04-08 15:07:52,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {813914#true} assume !(0 != ~p9~0); {813914#true} is VALID [2022-04-08 15:07:52,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {813914#true} assume !(0 != ~p10~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p1~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p2~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p3~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p4~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p5~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p6~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p7~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p8~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p9~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-08 15:07:52,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p10~0; {813915#false} is VALID [2022-04-08 15:07:52,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {813915#false} assume 1 != ~lk10~0; {813915#false} is VALID [2022-04-08 15:07:52,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {813915#false} assume !false; {813915#false} is VALID [2022-04-08 15:07:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:07:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:07:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099634913] [2022-04-08 15:07:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099634913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:07:52,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:07:52,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:07:52,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:07:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381036720] [2022-04-08 15:07:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381036720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:07:52,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:07:52,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:07:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082977105] [2022-04-08 15:07:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:07:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 15:07:52,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:07:52,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:52,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:52,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:07:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:07:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:07:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:07:52,447 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)