/usr/bin/java -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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-18 05:40:24,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 05:40:24,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 05:40:24,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 05:40:24,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 05:40:24,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 05:40:24,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 05:40:24,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 05:40:24,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 05:40:24,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 05:40:24,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 05:40:24,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 05:40:24,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 05:40:24,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 05:40:24,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 05:40:24,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 05:40:24,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 05:40:24,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 05:40:24,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 05:40:24,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 05:40:24,641 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 05:40:24,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 05:40:24,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 05:40:24,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 05:40:24,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 05:40:24,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 05:40:24,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 05:40:24,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 05:40:24,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 05:40:24,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 05:40:24,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 05:40:24,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 05:40:24,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 05:40:24,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 05:40:24,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 05:40:24,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 05:40:24,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 05:40:24,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 05:40:24,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 05:40:24,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 05:40:24,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 05:40:24,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 05:40:24,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-18 05:40:24,660 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 05:40:24,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 05:40:24,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 05:40:24,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 05:40:24,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:24,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-18 05:40:24,663 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-18 05:40:24,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 05:40:24,664 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-18 05:40:24,664 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-03-18 05:40:24,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 05:40:24,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 05:40:24,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 05:40:24,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 05:40:24,862 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 05:40:24,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-03-18 05:40:24,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e176eec/7b1016336b514bae82c6e5d462c337db/FLAG9f5348ad0 [2022-03-18 05:40:25,254 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 05:40:25,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-03-18 05:40:25,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e176eec/7b1016336b514bae82c6e5d462c337db/FLAG9f5348ad0 [2022-03-18 05:40:25,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e176eec/7b1016336b514bae82c6e5d462c337db [2022-03-18 05:40:25,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 05:40:25,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 05:40:25,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:25,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 05:40:25,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 05:40:25,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cda80b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25, skipping insertion in model container [2022-03-18 05:40:25,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 05:40:25,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 05:40:25,416 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_5.c[2207,2220] [2022-03-18 05:40:25,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:25,424 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 05:40:25,435 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_5.c[2207,2220] [2022-03-18 05:40:25,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:25,443 INFO L208 MainTranslator]: Completed translation [2022-03-18 05:40:25,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25 WrapperNode [2022-03-18 05:40:25,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:25,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 05:40:25,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 05:40:25,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 05:40:25,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 05:40:25,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 05:40:25,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 05:40:25,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 05:40:25,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (1/1) ... [2022-03-18 05:40:25,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 05:40:25,497 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-03-18 05:40:25,515 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-03-18 05:40:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 05:40:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 05:40:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 05:40:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 05:40:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 05:40:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 05:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 05:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 05:40:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 05:40:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 05:40:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 05:40:25,580 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 05:40:25,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 05:40:25,678 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 05:40:25,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 05:40:25,683 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 05:40:25,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:25 BoogieIcfgContainer [2022-03-18 05:40:25,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 05:40:25,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 05:40:25,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 05:40:25,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 05:40:25,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 05:40:25" (1/3) ... [2022-03-18 05:40:25,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41926ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:25, skipping insertion in model container [2022-03-18 05:40:25,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:25" (2/3) ... [2022-03-18 05:40:25,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41926ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:25, skipping insertion in model container [2022-03-18 05:40:25,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:25" (3/3) ... [2022-03-18 05:40:25,690 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-03-18 05:40:25,693 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-18 05:40:25,693 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 05:40:25,740 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 05:40:25,751 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-03-18 05:40:25,751 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 05:40:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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-03-18 05:40:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-18 05:40:25,766 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:25,767 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:25,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-03-18 05:40:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:25,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377296859] [2022-03-18 05:40:25,804 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-03-18 05:40:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:25,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435309000] [2022-03-18 05:40:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:25,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:25,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-03-18 05:40:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:25,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435309000] [2022-03-18 05:40:25,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435309000] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:25,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:25,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:25,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:25,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377296859] [2022-03-18 05:40:25,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377296859] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:25,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:25,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:25,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023580774] [2022-03-18 05:40:25,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:25,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,002 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,073 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-03-18 05:40:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-03-18 05:40:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,080 INFO L225 Difference]: With dead ends: 58 [2022-03-18 05:40:26,081 INFO L226 Difference]: Without dead ends: 43 [2022-03-18 05:40:26,082 INFO L911 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-03-18 05:40:26,085 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,085 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-18 05:40:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-03-18 05:40:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-03-18 05:40:26,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-03-18 05:40:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,109 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-03-18 05:40:26,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-03-18 05:40:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-18 05:40:26,109 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,110 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 05:40:26,110 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-03-18 05:40:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660909318] [2022-03-18 05:40:26,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-03-18 05:40:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948030031] [2022-03-18 05:40:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948030031] [2022-03-18 05:40:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948030031] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660909318] [2022-03-18 05:40:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660909318] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626868888] [2022-03-18 05:40:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,172 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,253 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-03-18 05:40:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 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 16 [2022-03-18 05:40:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,255 INFO L225 Difference]: With dead ends: 68 [2022-03-18 05:40:26,255 INFO L226 Difference]: Without dead ends: 43 [2022-03-18 05:40:26,255 INFO L911 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-03-18 05:40:26,256 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,257 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 05:40:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-18 05:40:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-03-18 05:40:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-03-18 05:40:26,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-03-18 05:40:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,272 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-03-18 05:40:26,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-03-18 05:40:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 05:40:26,273 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,273 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 05:40:26,273 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-03-18 05:40:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888166025] [2022-03-18 05:40:26,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-03-18 05:40:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607932607] [2022-03-18 05:40:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607932607] [2022-03-18 05:40:26,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607932607] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888166025] [2022-03-18 05:40:26,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888166025] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108178558] [2022-03-18 05:40:26,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,337 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,409 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-03-18 05:40:26,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-03-18 05:40:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,412 INFO L225 Difference]: With dead ends: 64 [2022-03-18 05:40:26,412 INFO L226 Difference]: Without dead ends: 46 [2022-03-18 05:40:26,412 INFO L911 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-03-18 05:40:26,415 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,419 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-18 05:40:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-03-18 05:40:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-03-18 05:40:26,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-03-18 05:40:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,430 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-03-18 05:40:26,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-03-18 05:40:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 05:40:26,431 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,431 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 05:40:26,431 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-03-18 05:40:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207288397] [2022-03-18 05:40:26,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-03-18 05:40:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304030223] [2022-03-18 05:40:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304030223] [2022-03-18 05:40:26,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304030223] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207288397] [2022-03-18 05:40:26,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207288397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895224101] [2022-03-18 05:40:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,505 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,565 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-03-18 05:40:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-03-18 05:40:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,569 INFO L225 Difference]: With dead ends: 112 [2022-03-18 05:40:26,569 INFO L226 Difference]: Without dead ends: 77 [2022-03-18 05:40:26,570 INFO L911 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-03-18 05:40:26,576 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,579 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-18 05:40:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-03-18 05:40:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-03-18 05:40:26,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-03-18 05:40:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,594 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-03-18 05:40:26,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-03-18 05:40:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 05:40:26,595 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,597 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 05:40:26,597 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-03-18 05:40:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495571317] [2022-03-18 05:40:26,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-03-18 05:40:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406312583] [2022-03-18 05:40:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406312583] [2022-03-18 05:40:26,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406312583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495571317] [2022-03-18 05:40:26,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495571317] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232730271] [2022-03-18 05:40:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,649 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,693 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-03-18 05:40:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 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 17 [2022-03-18 05:40:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,695 INFO L225 Difference]: With dead ends: 95 [2022-03-18 05:40:26,695 INFO L226 Difference]: Without dead ends: 93 [2022-03-18 05:40:26,695 INFO L911 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-03-18 05:40:26,696 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,696 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-18 05:40:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-03-18 05:40:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-03-18 05:40:26,718 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-03-18 05:40:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,718 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-03-18 05:40:26,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-03-18 05:40:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:26,719 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,719 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-18 05:40:26,719 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-03-18 05:40:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [862129542] [2022-03-18 05:40:26,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-03-18 05:40:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923064396] [2022-03-18 05:40:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923064396] [2022-03-18 05:40:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923064396] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [862129542] [2022-03-18 05:40:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [862129542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349819379] [2022-03-18 05:40:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,781 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,834 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-03-18 05:40:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-03-18 05:40:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,836 INFO L225 Difference]: With dead ends: 131 [2022-03-18 05:40:26,836 INFO L226 Difference]: Without dead ends: 129 [2022-03-18 05:40:26,836 INFO L911 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-03-18 05:40:26,839 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,839 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-18 05:40:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-03-18 05:40:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-03-18 05:40:26,858 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-03-18 05:40:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,858 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-03-18 05:40:26,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-03-18 05:40:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:26,863 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,863 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-18 05:40:26,864 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-03-18 05:40:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255197037] [2022-03-18 05:40:26,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-03-18 05:40:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509217603] [2022-03-18 05:40:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:26,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509217603] [2022-03-18 05:40:26,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509217603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:26,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255197037] [2022-03-18 05:40:26,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255197037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:26,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:26,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125009118] [2022-03-18 05:40:26,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:26,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:26,916 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:26,964 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-03-18 05:40:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-03-18 05:40:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:26,965 INFO L225 Difference]: With dead ends: 231 [2022-03-18 05:40:26,965 INFO L226 Difference]: Without dead ends: 137 [2022-03-18 05:40:26,966 INFO L911 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-03-18 05:40:26,967 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:26,967 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-18 05:40:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-03-18 05:40:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-03-18 05:40:26,979 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-03-18 05:40:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:26,979 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-03-18 05:40:26,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-03-18 05:40:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:26,980 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:26,980 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:26,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-18 05:40:26,980 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-03-18 05:40:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:26,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615453894] [2022-03-18 05:40:26,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-03-18 05:40:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:26,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082389538] [2022-03-18 05:40:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082389538] [2022-03-18 05:40:27,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082389538] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615453894] [2022-03-18 05:40:27,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615453894] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93935851] [2022-03-18 05:40:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,008 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,063 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-03-18 05:40:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 05:40:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,064 INFO L225 Difference]: With dead ends: 205 [2022-03-18 05:40:27,064 INFO L226 Difference]: Without dead ends: 143 [2022-03-18 05:40:27,064 INFO L911 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-03-18 05:40:27,065 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,065 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-18 05:40:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-03-18 05:40:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-03-18 05:40:27,076 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-03-18 05:40:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,077 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-03-18 05:40:27,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-03-18 05:40:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:27,078 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:27,078 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:27,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-18 05:40:27,078 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-03-18 05:40:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381259055] [2022-03-18 05:40:27,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-03-18 05:40:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:27,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335063676] [2022-03-18 05:40:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335063676] [2022-03-18 05:40:27,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335063676] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381259055] [2022-03-18 05:40:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381259055] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142928755] [2022-03-18 05:40:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,117 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,163 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-03-18 05:40:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 05:40:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,165 INFO L225 Difference]: With dead ends: 237 [2022-03-18 05:40:27,165 INFO L226 Difference]: Without dead ends: 235 [2022-03-18 05:40:27,165 INFO L911 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-03-18 05:40:27,166 INFO L912 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,166 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-18 05:40:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-03-18 05:40:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-03-18 05:40:27,180 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-03-18 05:40:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,180 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-03-18 05:40:27,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-03-18 05:40:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:27,181 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:27,181 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:27,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-18 05:40:27,181 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:27,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-03-18 05:40:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211037190] [2022-03-18 05:40:27,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-03-18 05:40:27,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:27,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426181740] [2022-03-18 05:40:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426181740] [2022-03-18 05:40:27,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426181740] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211037190] [2022-03-18 05:40:27,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211037190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810373692] [2022-03-18 05:40:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,218 INFO L87 Difference]: Start difference. First operand 201 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,277 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-03-18 05:40:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 05:40:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,278 INFO L225 Difference]: With dead ends: 445 [2022-03-18 05:40:27,278 INFO L226 Difference]: Without dead ends: 259 [2022-03-18 05:40:27,281 INFO L911 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-03-18 05:40:27,281 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,282 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-18 05:40:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-03-18 05:40:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-03-18 05:40:27,296 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-03-18 05:40:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,296 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-03-18 05:40:27,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-03-18 05:40:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:27,297 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:27,297 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:27,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-18 05:40:27,297 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-03-18 05:40:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211594668] [2022-03-18 05:40:27,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-03-18 05:40:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221060019] [2022-03-18 05:40:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221060019] [2022-03-18 05:40:27,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221060019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211594668] [2022-03-18 05:40:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211594668] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554907379] [2022-03-18 05:40:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,337 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,386 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-03-18 05:40:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,388 INFO L225 Difference]: With dead ends: 385 [2022-03-18 05:40:27,388 INFO L226 Difference]: Without dead ends: 267 [2022-03-18 05:40:27,388 INFO L911 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-03-18 05:40:27,388 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,389 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-18 05:40:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-03-18 05:40:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-03-18 05:40:27,411 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-03-18 05:40:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,411 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-03-18 05:40:27,411 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-03-18 05:40:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:27,412 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:27,412 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:27,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-18 05:40:27,412 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-03-18 05:40:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358088898] [2022-03-18 05:40:27,413 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-03-18 05:40:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:27,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253930303] [2022-03-18 05:40:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253930303] [2022-03-18 05:40:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253930303] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358088898] [2022-03-18 05:40:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358088898] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967201208] [2022-03-18 05:40:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,451 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,506 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-03-18 05:40:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,508 INFO L225 Difference]: With dead ends: 427 [2022-03-18 05:40:27,508 INFO L226 Difference]: Without dead ends: 425 [2022-03-18 05:40:27,508 INFO L911 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-03-18 05:40:27,509 INFO L912 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,509 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-03-18 05:40:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-03-18 05:40:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-03-18 05:40:27,529 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-03-18 05:40:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,529 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-03-18 05:40:27,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-03-18 05:40:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:27,531 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:27,531 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:27,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-18 05:40:27,531 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-03-18 05:40:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908579420] [2022-03-18 05:40:27,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-03-18 05:40:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506482229] [2022-03-18 05:40:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 05:40:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:27,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506482229] [2022-03-18 05:40:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506482229] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908579420] [2022-03-18 05:40:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908579420] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:27,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:27,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606930275] [2022-03-18 05:40:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:27,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:27,562 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:27,616 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-03-18 05:40:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 05:40:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:27,618 INFO L225 Difference]: With dead ends: 857 [2022-03-18 05:40:27,618 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 05:40:27,619 INFO L911 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-03-18 05:40:27,620 INFO L912 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:27,620 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 05:40:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 05:40:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-18 05:40:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 05:40:27,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-03-18 05:40:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:27,621 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 05:40:27,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 05:40:27,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 05:40:27,623 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 05:40:27,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-18 05:40:27,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 05:40:30,363 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-18 05:40:30,363 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-18 05:40:30,364 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-03-18 05:40:30,364 INFO L878 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-03-18 05:40:30,364 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-03-18 05:40:30,365 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-03-18 05:40:30,365 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-03-18 05:40:30,365 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-03-18 05:40:30,365 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-03-18 05:40:30,366 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-03-18 05:40:30,366 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-03-18 05:40:30,366 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-03-18 05:40:30,366 INFO L878 garLoopResultBuilder]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-03-18 05:40:30,367 INFO L878 garLoopResultBuilder]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-03-18 05:40:30,367 INFO L878 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-03-18 05:40:30,367 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-03-18 05:40:30,367 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-03-18 05:40:30,367 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-03-18 05:40:30,367 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-03-18 05:40:30,369 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-18 05:40:30,370 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 05:40:30,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 05:40:30 BoogieIcfgContainer [2022-03-18 05:40:30,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 05:40:30,379 INFO L158 Benchmark]: Toolchain (without parser) took 5109.23ms. Allocated memory was 209.7MB in the beginning and 358.6MB in the end (delta: 148.9MB). Free memory was 159.4MB in the beginning and 159.2MB in the end (delta: 244.6kB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. [2022-03-18 05:40:30,379 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory was 175.4MB in the beginning and 175.3MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 05:40:30,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.54ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 184.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-18 05:40:30,379 INFO L158 Benchmark]: Boogie Preprocessor took 17.58ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 183.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-18 05:40:30,379 INFO L158 Benchmark]: RCFGBuilder took 221.98ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 172.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-18 05:40:30,380 INFO L158 Benchmark]: TraceAbstraction took 4692.60ms. Allocated memory was 209.7MB in the beginning and 358.6MB in the end (delta: 148.9MB). Free memory was 172.3MB in the beginning and 159.2MB in the end (delta: 13.1MB). Peak memory consumption was 198.2MB. Max. memory is 8.0GB. [2022-03-18 05:40:30,380 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory was 175.4MB in the beginning and 175.3MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.54ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 184.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.58ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 183.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.98ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 172.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4692.60ms. Allocated memory was 209.7MB in the beginning and 358.6MB in the end (delta: 148.9MB). Free memory was 172.3MB in the beginning and 159.2MB in the end (delta: 13.1MB). Peak memory consumption was 198.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-18 05:40:30,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...