/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 17:17:04,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 17:17:04,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 17:17:04,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 17:17:04,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 17:17:04,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 17:17:04,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 17:17:04,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 17:17:04,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 17:17:04,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 17:17:04,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 17:17:04,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 17:17:04,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 17:17:04,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 17:17:04,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 17:17:04,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 17:17:04,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 17:17:04,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 17:17:04,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 17:17:04,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 17:17:04,637 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 17:17:04,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 17:17:04,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 17:17:04,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 17:17:04,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 17:17:04,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 17:17:04,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 17:17:04,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 17:17:04,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 17:17:04,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 17:17:04,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 17:17:04,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 17:17:04,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 17:17:04,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 17:17:04,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 17:17:04,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 17:17:04,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 17:17:04,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 17:17:04,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 17:17:04,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 17:17:04,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 17:17:04,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 17:17:04,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 17:17:04,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 17:17:04,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 17:17:04,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 17:17:04,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 17:17:04,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 17:17:04,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 17:17:04,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 17:17:04,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 17:17:04,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 17:17:04,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 17:17:04,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 17:17:04,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 17:17:04,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 17:17:04,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:17:04,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 17:17:04,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 17:17:04,669 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 17:17:04,669 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 17:17:04,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 17:17:04,669 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 17:17:04,669 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-20 17:17:04,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 17:17:04,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 17:17:04,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 17:17:04,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 17:17:04,918 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 17:17:04,919 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-20 17:17:04,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a5c523e/b5bc9d74db384ea092784f0cd0faf366/FLAG2c6973933 [2022-03-20 17:17:05,356 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 17:17:05,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-03-20 17:17:05,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a5c523e/b5bc9d74db384ea092784f0cd0faf366/FLAG2c6973933 [2022-03-20 17:17:05,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a5c523e/b5bc9d74db384ea092784f0cd0faf366 [2022-03-20 17:17:05,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 17:17:05,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 17:17:05,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 17:17:05,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 17:17:05,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 17:17:05,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73304d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05, skipping insertion in model container [2022-03-20 17:17:05,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 17:17:05,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 17:17:05,552 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-20 17:17:05,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:17:05,560 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 17:17:05,573 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-20 17:17:05,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:17:05,583 INFO L208 MainTranslator]: Completed translation [2022-03-20 17:17:05,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05 WrapperNode [2022-03-20 17:17:05,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 17:17:05,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 17:17:05,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 17:17:05,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 17:17:05,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 17:17:05,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 17:17:05,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 17:17:05,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 17:17:05,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (1/1) ... [2022-03-20 17:17:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:17:05,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:17:05,633 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-20 17:17:05,640 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-20 17:17:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 17:17:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 17:17:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 17:17:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 17:17:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 17:17:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 17:17:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 17:17:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 17:17:05,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 17:17:05,722 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 17:17:05,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 17:17:05,821 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 17:17:05,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 17:17:05,826 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 17:17:05,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:17:05 BoogieIcfgContainer [2022-03-20 17:17:05,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 17:17:05,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 17:17:05,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 17:17:05,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 17:17:05,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:17:05" (1/3) ... [2022-03-20 17:17:05,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41962fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:17:05, skipping insertion in model container [2022-03-20 17:17:05,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:05" (2/3) ... [2022-03-20 17:17:05,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41962fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:17:05, skipping insertion in model container [2022-03-20 17:17:05,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:17:05" (3/3) ... [2022-03-20 17:17:05,834 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-03-20 17:17:05,838 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 17:17:05,838 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 17:17:05,875 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 17:17:05,881 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-20 17:17:05,882 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 17:17:05,894 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-20 17:17:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 17:17:05,901 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:05,901 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:05,902 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-03-20 17:17:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986318386] [2022-03-20 17:17:05,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-03-20 17:17:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:05,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188295518] [2022-03-20 17:17:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,213 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-20 17:17:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:06,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188295518] [2022-03-20 17:17:06,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188295518] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:06,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986318386] [2022-03-20 17:17:06,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986318386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157799289] [2022-03-20 17:17:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:06,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:06,248 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-20 17:17:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:06,337 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-03-20 17:17:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:06,339 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-20 17:17:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:06,346 INFO L225 Difference]: With dead ends: 58 [2022-03-20 17:17:06,346 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 17:17:06,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:06,351 INFO L913 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:06,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 17:17:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-03-20 17:17:06,381 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-20 17:17:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-03-20 17:17:06,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-03-20 17:17:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:06,384 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-03-20 17:17:06,384 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-20 17:17:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-03-20 17:17:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 17:17:06,385 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:06,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:06,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 17:17:06,386 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-03-20 17:17:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921748685] [2022-03-20 17:17:06,388 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-03-20 17:17:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938757960] [2022-03-20 17:17:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,456 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-20 17:17:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938757960] [2022-03-20 17:17:06,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938757960] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921748685] [2022-03-20 17:17:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921748685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981449635] [2022-03-20 17:17:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:06,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:06,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:06,461 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-20 17:17:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:06,547 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-03-20 17:17:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:06,548 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-20 17:17:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:06,550 INFO L225 Difference]: With dead ends: 68 [2022-03-20 17:17:06,550 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 17:17:06,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:06,552 INFO L913 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-20 17:17:06,552 INFO L914 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-20 17:17:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 17:17:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-03-20 17:17:06,562 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-20 17:17:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-03-20 17:17:06,563 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-03-20 17:17:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:06,563 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-03-20 17:17:06,563 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-20 17:17:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-03-20 17:17:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 17:17:06,564 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:06,564 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:06,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 17:17:06,565 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-03-20 17:17:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716836441] [2022-03-20 17:17:06,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-03-20 17:17:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:06,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482703618] [2022-03-20 17:17:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,628 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-20 17:17:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:06,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482703618] [2022-03-20 17:17:06,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482703618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:06,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716836441] [2022-03-20 17:17:06,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716836441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150960869] [2022-03-20 17:17:06,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:06,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:06,632 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-20 17:17:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:06,728 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-03-20 17:17:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:06,730 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-20 17:17:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:06,731 INFO L225 Difference]: With dead ends: 64 [2022-03-20 17:17:06,731 INFO L226 Difference]: Without dead ends: 46 [2022-03-20 17:17:06,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:06,733 INFO L913 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:06,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-20 17:17:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-03-20 17:17:06,743 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-20 17:17:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-03-20 17:17:06,744 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-03-20 17:17:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:06,744 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-03-20 17:17:06,744 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-20 17:17:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-03-20 17:17:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 17:17:06,745 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:06,745 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:06,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 17:17:06,746 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-03-20 17:17:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324835871] [2022-03-20 17:17:06,748 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-03-20 17:17:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:06,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779456651] [2022-03-20 17:17:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:06,820 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-20 17:17:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779456651] [2022-03-20 17:17:06,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779456651] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324835871] [2022-03-20 17:17:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324835871] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211033506] [2022-03-20 17:17:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:06,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:06,824 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-20 17:17:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:06,898 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-03-20 17:17:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:06,899 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-20 17:17:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:06,902 INFO L225 Difference]: With dead ends: 112 [2022-03-20 17:17:06,902 INFO L226 Difference]: Without dead ends: 77 [2022-03-20 17:17:06,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:06,913 INFO L913 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-20 17:17:06,915 INFO L914 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-20 17:17:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-20 17:17:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-03-20 17:17:06,931 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-20 17:17:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-03-20 17:17:06,936 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-03-20 17:17:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:06,937 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-03-20 17:17:06,937 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-20 17:17:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-03-20 17:17:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 17:17:06,938 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:06,938 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:06,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 17:17:06,938 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-03-20 17:17:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202779516] [2022-03-20 17:17:06,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-03-20 17:17:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714565955] [2022-03-20 17:17:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,031 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-20 17:17:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714565955] [2022-03-20 17:17:07,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714565955] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202779516] [2022-03-20 17:17:07,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202779516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450540879] [2022-03-20 17:17:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,035 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-20 17:17:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,098 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-03-20 17:17:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,098 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-20 17:17:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,101 INFO L225 Difference]: With dead ends: 95 [2022-03-20 17:17:07,102 INFO L226 Difference]: Without dead ends: 93 [2022-03-20 17:17:07,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,105 INFO L913 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-20 17:17:07,107 INFO L914 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-20 17:17:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-20 17:17:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-03-20 17:17:07,124 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-20 17:17:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-03-20 17:17:07,125 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-03-20 17:17:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,125 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-03-20 17:17:07,126 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-20 17:17:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-03-20 17:17:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 17:17:07,126 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,127 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 17:17:07,131 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-03-20 17:17:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116704725] [2022-03-20 17:17:07,137 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-03-20 17:17:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665195553] [2022-03-20 17:17:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,202 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-20 17:17:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665195553] [2022-03-20 17:17:07,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665195553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116704725] [2022-03-20 17:17:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116704725] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628135990] [2022-03-20 17:17:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,208 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-20 17:17:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,267 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-03-20 17:17:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,268 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-20 17:17:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,270 INFO L225 Difference]: With dead ends: 131 [2022-03-20 17:17:07,270 INFO L226 Difference]: Without dead ends: 129 [2022-03-20 17:17:07,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,272 INFO L913 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-20 17:17:07,272 INFO L914 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-20 17:17:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-20 17:17:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-03-20 17:17:07,297 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-20 17:17:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-03-20 17:17:07,299 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-03-20 17:17:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,300 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-03-20 17:17:07,300 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-20 17:17:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-03-20 17:17:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 17:17:07,306 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,306 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 17:17:07,306 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-03-20 17:17:07,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901099002] [2022-03-20 17:17:07,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-03-20 17:17:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205770805] [2022-03-20 17:17:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,357 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-20 17:17:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205770805] [2022-03-20 17:17:07,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205770805] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901099002] [2022-03-20 17:17:07,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901099002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599466935] [2022-03-20 17:17:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,360 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-20 17:17:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,426 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-03-20 17:17:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,427 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-20 17:17:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,428 INFO L225 Difference]: With dead ends: 231 [2022-03-20 17:17:07,428 INFO L226 Difference]: Without dead ends: 137 [2022-03-20 17:17:07,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,430 INFO L913 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-20 17:17:07,430 INFO L914 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-20 17:17:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-20 17:17:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-03-20 17:17:07,459 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-20 17:17:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-03-20 17:17:07,460 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-03-20 17:17:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,461 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-03-20 17:17:07,461 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-20 17:17:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-03-20 17:17:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 17:17:07,462 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 17:17:07,463 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-03-20 17:17:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800712027] [2022-03-20 17:17:07,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-03-20 17:17:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340066090] [2022-03-20 17:17:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,535 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-20 17:17:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340066090] [2022-03-20 17:17:07,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340066090] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800712027] [2022-03-20 17:17:07,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800712027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862408401] [2022-03-20 17:17:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,538 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-20 17:17:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,593 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-03-20 17:17:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,593 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-20 17:17:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,594 INFO L225 Difference]: With dead ends: 205 [2022-03-20 17:17:07,594 INFO L226 Difference]: Without dead ends: 143 [2022-03-20 17:17:07,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,596 INFO L913 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-20 17:17:07,597 INFO L914 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-20 17:17:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-20 17:17:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-03-20 17:17:07,614 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-20 17:17:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-03-20 17:17:07,614 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-03-20 17:17:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,616 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-03-20 17:17:07,616 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-20 17:17:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-03-20 17:17:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 17:17:07,617 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,617 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 17:17:07,617 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-03-20 17:17:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032361838] [2022-03-20 17:17:07,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-03-20 17:17:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616676508] [2022-03-20 17:17:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,664 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-20 17:17:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616676508] [2022-03-20 17:17:07,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616676508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032361838] [2022-03-20 17:17:07,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032361838] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792224139] [2022-03-20 17:17:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,666 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-20 17:17:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,726 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-03-20 17:17:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,727 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-20 17:17:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,728 INFO L225 Difference]: With dead ends: 237 [2022-03-20 17:17:07,729 INFO L226 Difference]: Without dead ends: 235 [2022-03-20 17:17:07,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,732 INFO L913 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-20 17:17:07,734 INFO L914 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-20 17:17:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-20 17:17:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-03-20 17:17:07,763 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-20 17:17:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-03-20 17:17:07,764 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-03-20 17:17:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,765 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-03-20 17:17:07,765 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-20 17:17:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-03-20 17:17:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 17:17:07,766 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,766 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 17:17:07,766 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-03-20 17:17:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203778655] [2022-03-20 17:17:07,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-03-20 17:17:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727176166] [2022-03-20 17:17:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,812 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-20 17:17:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727176166] [2022-03-20 17:17:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727176166] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203778655] [2022-03-20 17:17:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203778655] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:07,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:07,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262984747] [2022-03-20 17:17:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:07,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:07,815 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-20 17:17:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:07,907 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-03-20 17:17:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:07,908 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-20 17:17:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:07,909 INFO L225 Difference]: With dead ends: 445 [2022-03-20 17:17:07,909 INFO L226 Difference]: Without dead ends: 259 [2022-03-20 17:17:07,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:07,913 INFO L913 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-20 17:17:07,914 INFO L914 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-20 17:17:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-20 17:17:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-03-20 17:17:07,945 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-20 17:17:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-03-20 17:17:07,946 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-03-20 17:17:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:07,946 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-03-20 17:17:07,946 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-20 17:17:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-03-20 17:17:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:07,947 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:07,947 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:07,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 17:17:07,948 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-03-20 17:17:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:07,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716799339] [2022-03-20 17:17:07,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-03-20 17:17:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568825812] [2022-03-20 17:17:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:07,999 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-20 17:17:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568825812] [2022-03-20 17:17:08,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568825812] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716799339] [2022-03-20 17:17:08,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716799339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884116871] [2022-03-20 17:17:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:08,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:08,002 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-20 17:17:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:08,079 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-03-20 17:17:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:08,080 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-20 17:17:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:08,081 INFO L225 Difference]: With dead ends: 385 [2022-03-20 17:17:08,082 INFO L226 Difference]: Without dead ends: 267 [2022-03-20 17:17:08,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:08,083 INFO L913 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-20 17:17:08,083 INFO L914 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-20 17:17:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-20 17:17:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-03-20 17:17:08,113 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-20 17:17:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-03-20 17:17:08,114 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-03-20 17:17:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:08,115 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-03-20 17:17:08,115 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-20 17:17:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-03-20 17:17:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:08,116 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:08,116 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:08,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 17:17:08,116 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-03-20 17:17:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:08,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47620202] [2022-03-20 17:17:08,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-03-20 17:17:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:08,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425391789] [2022-03-20 17:17:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:08,160 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-20 17:17:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:08,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425391789] [2022-03-20 17:17:08,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425391789] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:08,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47620202] [2022-03-20 17:17:08,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47620202] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536857020] [2022-03-20 17:17:08,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:08,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:08,163 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-20 17:17:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:08,250 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-03-20 17:17:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:08,251 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-20 17:17:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:08,253 INFO L225 Difference]: With dead ends: 427 [2022-03-20 17:17:08,253 INFO L226 Difference]: Without dead ends: 425 [2022-03-20 17:17:08,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:08,254 INFO L913 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-20 17:17:08,255 INFO L914 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-20 17:17:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-03-20 17:17:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-03-20 17:17:08,296 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-20 17:17:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-03-20 17:17:08,298 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-03-20 17:17:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:08,298 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-03-20 17:17:08,298 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-20 17:17:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-03-20 17:17:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:08,300 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:08,300 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:08,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 17:17:08,300 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-03-20 17:17:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704928761] [2022-03-20 17:17:08,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-03-20 17:17:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:08,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673493177] [2022-03-20 17:17:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:08,339 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-20 17:17:08,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673493177] [2022-03-20 17:17:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673493177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:08,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704928761] [2022-03-20 17:17:08,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704928761] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:08,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003986367] [2022-03-20 17:17:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:08,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:08,341 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-20 17:17:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:08,425 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-03-20 17:17:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:08,426 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-20 17:17:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:08,427 INFO L225 Difference]: With dead ends: 857 [2022-03-20 17:17:08,427 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 17:17:08,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:08,430 INFO L913 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-20 17:17:08,431 INFO L914 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-20 17:17:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 17:17:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 17:17:08,431 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-20 17:17:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 17:17:08,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-03-20 17:17:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:08,432 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 17:17:08,438 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-20 17:17:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 17:17:08,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 17:17:08,441 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 17:17:08,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 17:17:08,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 17:17:11,830 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 17:17:11,831 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 17:17:11,831 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 17:17:11,831 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,831 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-20 17:17:11,831 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,831 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-03-20 17:17:11,832 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-20 17:17:11,832 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-20 17:17:11,832 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-03-20 17:17:11,832 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-03-20 17:17:11,833 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-03-20 17:17:11,833 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-20 17:17:11,833 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-20 17:17:11,833 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-03-20 17:17:11,833 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-03-20 17:17:11,833 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-20 17:17:11,833 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-20 17:17:11,834 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-03-20 17:17:11,834 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-03-20 17:17:11,834 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-20 17:17:11,834 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-20 17:17:11,834 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-20 17:17:11,834 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-20 17:17:11,834 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-20 17:17:11,835 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-20 17:17:11,835 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-03-20 17:17:11,835 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-20 17:17:11,838 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-20 17:17:11,839 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 17:17:11,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 05:17:11 BoogieIcfgContainer [2022-03-20 17:17:11,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 17:17:11,848 INFO L158 Benchmark]: Toolchain (without parser) took 6469.40ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 129.8MB in the beginning and 227.0MB in the end (delta: -97.2MB). Peak memory consumption was 129.7MB. Max. memory is 8.0GB. [2022-03-20 17:17:11,848 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 17:17:11,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.41ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 156.3MB in the end (delta: -26.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-20 17:17:11,849 INFO L158 Benchmark]: Boogie Preprocessor took 22.63ms. Allocated memory is still 180.4MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 17:17:11,849 INFO L158 Benchmark]: RCFGBuilder took 220.45ms. Allocated memory is still 180.4MB. Free memory was 154.6MB in the beginning and 144.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 17:17:11,849 INFO L158 Benchmark]: TraceAbstraction took 6018.58ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 143.5MB in the beginning and 227.0MB in the end (delta: -83.5MB). Peak memory consumption was 142.3MB. Max. memory is 8.0GB. [2022-03-20 17:17:11,850 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.11ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.41ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 156.3MB in the end (delta: -26.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.63ms. Allocated memory is still 180.4MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.45ms. Allocated memory is still 180.4MB. Free memory was 154.6MB in the beginning and 144.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6018.58ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 143.5MB in the beginning and 227.0MB in the end (delta: -83.5MB). Peak memory consumption was 142.3MB. 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: 6.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.4s 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.2s 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.3s 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-20 17:17:11,883 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...