/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-6c470ae [2022-02-15 02:55:22,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 02:55:22,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 02:55:22,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 02:55:22,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 02:55:22,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 02:55:22,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 02:55:22,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 02:55:22,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 02:55:22,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 02:55:22,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 02:55:22,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 02:55:22,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 02:55:22,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 02:55:22,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 02:55:22,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 02:55:22,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 02:55:22,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 02:55:22,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 02:55:22,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 02:55:22,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 02:55:22,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 02:55:22,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 02:55:22,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 02:55:22,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 02:55:22,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 02:55:22,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 02:55:22,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 02:55:22,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 02:55:22,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 02:55:22,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 02:55:22,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 02:55:22,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 02:55:22,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 02:55:22,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 02:55:22,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 02:55:22,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 02:55:22,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 02:55:22,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 02:55:22,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 02:55:22,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 02:55:22,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 02:55:22,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 02:55:22,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 02:55:22,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 02:55:22,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 02:55:22,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 02:55:22,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:55:22,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 02:55:22,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 02:55:22,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 02:55:22,161 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 02:55:22,161 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-02-15 02:55:22,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 02:55:22,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 02:55:22,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 02:55:22,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 02:55:22,387 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 02:55:22,388 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-02-15 02:55:22,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b251579b8/7254de76711e4efd8b934bf9a9705997/FLAG767b26232 [2022-02-15 02:55:22,800 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 02:55:22,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-02-15 02:55:22,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b251579b8/7254de76711e4efd8b934bf9a9705997/FLAG767b26232 [2022-02-15 02:55:23,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b251579b8/7254de76711e4efd8b934bf9a9705997 [2022-02-15 02:55:23,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 02:55:23,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 02:55:23,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 02:55:23,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 02:55:23,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 02:55:23,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ecd8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23, skipping insertion in model container [2022-02-15 02:55:23,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 02:55:23,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 02:55:23,437 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-02-15 02:55:23,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:55:23,447 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 02:55:23,460 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-02-15 02:55:23,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:55:23,470 INFO L208 MainTranslator]: Completed translation [2022-02-15 02:55:23,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23 WrapperNode [2022-02-15 02:55:23,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 02:55:23,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 02:55:23,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 02:55:23,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 02:55:23,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 02:55:23,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 02:55:23,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 02:55:23,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 02:55:23,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (1/1) ... [2022-02-15 02:55:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:55:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 02:55:23,523 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-02-15 02:55:23,527 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-02-15 02:55:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 02:55:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 02:55:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 02:55:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 02:55:23,553 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 02:55:23,553 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 02:55:23,553 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 02:55:23,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 02:55:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 02:55:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 02:55:23,605 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 02:55:23,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 02:55:23,785 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 02:55:23,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 02:55:23,790 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 02:55:23,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:55:23 BoogieIcfgContainer [2022-02-15 02:55:23,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 02:55:23,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 02:55:23,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 02:55:23,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 02:55:23,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:55:23" (1/3) ... [2022-02-15 02:55:23,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbba51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:55:23, skipping insertion in model container [2022-02-15 02:55:23,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:55:23" (2/3) ... [2022-02-15 02:55:23,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbba51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:55:23, skipping insertion in model container [2022-02-15 02:55:23,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:55:23" (3/3) ... [2022-02-15 02:55:23,813 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-02-15 02:55:23,817 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 02:55:23,817 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 02:55:23,867 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 02:55:23,874 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-02-15 02:55:23,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 02:55:23,885 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-02-15 02:55:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 02:55:23,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:23,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:23,892 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-02-15 02:55:23,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:23,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77073781] [2022-02-15 02:55:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:23,966 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:24,170 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:24,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77073781] [2022-02-15 02:55:24,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [77073781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:24,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:24,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:24,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042522701] [2022-02-15 02:55:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:24,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:24,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:24,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:24,207 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-02-15 02:55:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:24,339 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-02-15 02:55:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:24,343 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-02-15 02:55:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:24,352 INFO L225 Difference]: With dead ends: 58 [2022-02-15 02:55:24,352 INFO L226 Difference]: Without dead ends: 43 [2022-02-15 02:55:24,355 INFO L932 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-02-15 02:55:24,361 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-15 02:55:24,361 INFO L934 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-02-15 02:55:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-15 02:55:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-02-15 02:55:24,401 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-02-15 02:55:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-02-15 02:55:24,405 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-02-15 02:55:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:24,407 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-02-15 02:55:24,407 INFO L471 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-02-15 02:55:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-02-15 02:55:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 02:55:24,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:24,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:24,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 02:55:24,410 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-02-15 02:55:24,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:24,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82670691] [2022-02-15 02:55:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:24,415 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:24,476 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:24,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82670691] [2022-02-15 02:55:24,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [82670691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:24,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:24,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:24,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159494660] [2022-02-15 02:55:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:24,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:24,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:24,481 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-02-15 02:55:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:24,560 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-02-15 02:55:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:24,561 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-02-15 02:55:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:24,562 INFO L225 Difference]: With dead ends: 68 [2022-02-15 02:55:24,562 INFO L226 Difference]: Without dead ends: 43 [2022-02-15 02:55:24,562 INFO L932 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-02-15 02:55:24,564 INFO L933 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.0s IncrementalHoareTripleChecker+Time [2022-02-15 02:55:24,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 02:55:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-15 02:55:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-02-15 02:55:24,582 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-02-15 02:55:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-02-15 02:55:24,585 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-02-15 02:55:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:24,586 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-02-15 02:55:24,586 INFO L471 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-02-15 02:55:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-02-15 02:55:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 02:55:24,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:24,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:24,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 02:55:24,589 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-02-15 02:55:24,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:24,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393702696] [2022-02-15 02:55:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:24,595 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:24,650 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:24,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393702696] [2022-02-15 02:55:24,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [393702696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:24,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:24,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:24,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222849746] [2022-02-15 02:55:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:24,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:24,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:24,652 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-02-15 02:55:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:24,722 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-02-15 02:55:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:24,723 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-02-15 02:55:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:24,725 INFO L225 Difference]: With dead ends: 64 [2022-02-15 02:55:24,725 INFO L226 Difference]: Without dead ends: 46 [2022-02-15 02:55:24,725 INFO L932 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-02-15 02:55:24,731 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 02:55:24,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 02:55:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-15 02:55:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-02-15 02:55:24,738 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-02-15 02:55:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-02-15 02:55:24,739 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-02-15 02:55:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:24,740 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-02-15 02:55:24,740 INFO L471 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-02-15 02:55:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-02-15 02:55:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 02:55:24,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:24,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:24,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 02:55:24,741 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-02-15 02:55:24,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:24,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183375830] [2022-02-15 02:55:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:24,747 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:24,797 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:24,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183375830] [2022-02-15 02:55:24,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [183375830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:24,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:24,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:24,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386013077] [2022-02-15 02:55:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:24,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:24,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:24,799 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-02-15 02:55:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:24,849 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-02-15 02:55:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:24,850 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-02-15 02:55:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:24,851 INFO L225 Difference]: With dead ends: 112 [2022-02-15 02:55:24,851 INFO L226 Difference]: Without dead ends: 77 [2022-02-15 02:55:24,851 INFO L932 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-02-15 02:55:24,852 INFO L933 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-02-15 02:55:24,853 INFO L934 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-02-15 02:55:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-15 02:55:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-02-15 02:55:24,865 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-02-15 02:55:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-02-15 02:55:24,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-02-15 02:55:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:24,867 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-02-15 02:55:24,867 INFO L471 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-02-15 02:55:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-02-15 02:55:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 02:55:24,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:24,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:24,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 02:55:24,868 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-02-15 02:55:24,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:24,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053350056] [2022-02-15 02:55:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:24,874 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:24,938 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:24,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053350056] [2022-02-15 02:55:24,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1053350056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:24,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:24,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:24,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276096074] [2022-02-15 02:55:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:24,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:24,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:24,941 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-02-15 02:55:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,043 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-02-15 02:55:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,044 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-02-15 02:55:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,047 INFO L225 Difference]: With dead ends: 95 [2022-02-15 02:55:25,047 INFO L226 Difference]: Without dead ends: 93 [2022-02-15 02:55:25,048 INFO L932 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-02-15 02:55:25,049 INFO L933 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-02-15 02:55:25,049 INFO L934 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-02-15 02:55:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-15 02:55:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-02-15 02:55:25,073 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-02-15 02:55:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-02-15 02:55:25,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-02-15 02:55:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,079 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-02-15 02:55:25,080 INFO L471 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-02-15 02:55:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-02-15 02:55:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 02:55:25,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 02:55:25,083 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-02-15 02:55:25,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229192472] [2022-02-15 02:55:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,086 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,139 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229192472] [2022-02-15 02:55:25,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [229192472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996331097] [2022-02-15 02:55:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,142 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-02-15 02:55:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,204 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-02-15 02:55:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,204 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-02-15 02:55:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,206 INFO L225 Difference]: With dead ends: 131 [2022-02-15 02:55:25,206 INFO L226 Difference]: Without dead ends: 129 [2022-02-15 02:55:25,206 INFO L932 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-02-15 02:55:25,208 INFO L933 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-02-15 02:55:25,210 INFO L934 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-02-15 02:55:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-15 02:55:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-02-15 02:55:25,228 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-02-15 02:55:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-02-15 02:55:25,229 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-02-15 02:55:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,230 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-02-15 02:55:25,230 INFO L471 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-02-15 02:55:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-02-15 02:55:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 02:55:25,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 02:55:25,231 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-02-15 02:55:25,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041748237] [2022-02-15 02:55:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,234 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,265 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041748237] [2022-02-15 02:55:25,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1041748237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617265806] [2022-02-15 02:55:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,267 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-02-15 02:55:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,328 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-02-15 02:55:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,329 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-02-15 02:55:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,329 INFO L225 Difference]: With dead ends: 231 [2022-02-15 02:55:25,330 INFO L226 Difference]: Without dead ends: 137 [2022-02-15 02:55:25,330 INFO L932 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-02-15 02:55:25,332 INFO L933 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-02-15 02:55:25,333 INFO L934 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-02-15 02:55:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-15 02:55:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-02-15 02:55:25,352 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-02-15 02:55:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-02-15 02:55:25,355 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-02-15 02:55:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,355 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-02-15 02:55:25,355 INFO L471 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-02-15 02:55:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-02-15 02:55:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 02:55:25,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 02:55:25,360 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-02-15 02:55:25,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38403416] [2022-02-15 02:55:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,364 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,415 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38403416] [2022-02-15 02:55:25,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [38403416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649888500] [2022-02-15 02:55:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,418 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-02-15 02:55:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,474 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-02-15 02:55:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,474 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-02-15 02:55:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,476 INFO L225 Difference]: With dead ends: 205 [2022-02-15 02:55:25,476 INFO L226 Difference]: Without dead ends: 143 [2022-02-15 02:55:25,477 INFO L932 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-02-15 02:55:25,478 INFO L933 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-02-15 02:55:25,478 INFO L934 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-02-15 02:55:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-15 02:55:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-02-15 02:55:25,498 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-02-15 02:55:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-02-15 02:55:25,498 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-02-15 02:55:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,500 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-02-15 02:55:25,500 INFO L471 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-02-15 02:55:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-02-15 02:55:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 02:55:25,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 02:55:25,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-02-15 02:55:25,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452308471] [2022-02-15 02:55:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,505 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,542 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452308471] [2022-02-15 02:55:25,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [452308471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654239460] [2022-02-15 02:55:25,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,544 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-02-15 02:55:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,608 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-02-15 02:55:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,609 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-02-15 02:55:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,610 INFO L225 Difference]: With dead ends: 237 [2022-02-15 02:55:25,610 INFO L226 Difference]: Without dead ends: 235 [2022-02-15 02:55:25,611 INFO L932 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-02-15 02:55:25,612 INFO L933 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-02-15 02:55:25,613 INFO L934 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-02-15 02:55:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-15 02:55:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-02-15 02:55:25,635 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-02-15 02:55:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-02-15 02:55:25,636 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-02-15 02:55:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,636 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-02-15 02:55:25,636 INFO L471 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-02-15 02:55:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-02-15 02:55:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 02:55:25,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 02:55:25,638 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-02-15 02:55:25,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352710402] [2022-02-15 02:55:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,640 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,682 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352710402] [2022-02-15 02:55:25,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1352710402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741270261] [2022-02-15 02:55:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,684 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-02-15 02:55:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,744 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-02-15 02:55:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,745 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-02-15 02:55:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,746 INFO L225 Difference]: With dead ends: 445 [2022-02-15 02:55:25,746 INFO L226 Difference]: Without dead ends: 259 [2022-02-15 02:55:25,747 INFO L932 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-02-15 02:55:25,748 INFO L933 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-02-15 02:55:25,748 INFO L934 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-02-15 02:55:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-15 02:55:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-02-15 02:55:25,772 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-02-15 02:55:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-02-15 02:55:25,773 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-02-15 02:55:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,774 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-02-15 02:55:25,774 INFO L471 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-02-15 02:55:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-02-15 02:55:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 02:55:25,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 02:55:25,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-02-15 02:55:25,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127346144] [2022-02-15 02:55:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,778 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,801 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127346144] [2022-02-15 02:55:25,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2127346144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326879604] [2022-02-15 02:55:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,803 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-02-15 02:55:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:25,870 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-02-15 02:55:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:25,870 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-02-15 02:55:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:25,871 INFO L225 Difference]: With dead ends: 385 [2022-02-15 02:55:25,871 INFO L226 Difference]: Without dead ends: 267 [2022-02-15 02:55:25,872 INFO L932 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-02-15 02:55:25,873 INFO L933 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-02-15 02:55:25,873 INFO L934 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-02-15 02:55:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-02-15 02:55:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-02-15 02:55:25,899 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-02-15 02:55:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-02-15 02:55:25,901 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-02-15 02:55:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:25,901 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-02-15 02:55:25,901 INFO L471 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-02-15 02:55:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-02-15 02:55:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 02:55:25,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:25,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:25,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 02:55:25,902 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-02-15 02:55:25,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:25,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581540488] [2022-02-15 02:55:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:25,904 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:25,926 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:25,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581540488] [2022-02-15 02:55:25,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1581540488] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:25,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:25,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:25,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695255458] [2022-02-15 02:55:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:25,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:25,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:25,928 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-02-15 02:55:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:26,012 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-02-15 02:55:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:26,012 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-02-15 02:55:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:26,014 INFO L225 Difference]: With dead ends: 427 [2022-02-15 02:55:26,014 INFO L226 Difference]: Without dead ends: 425 [2022-02-15 02:55:26,014 INFO L932 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-02-15 02:55:26,015 INFO L933 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-02-15 02:55:26,016 INFO L934 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-02-15 02:55:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-02-15 02:55:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-02-15 02:55:26,052 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-02-15 02:55:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-02-15 02:55:26,054 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-02-15 02:55:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:26,054 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-02-15 02:55:26,054 INFO L471 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-02-15 02:55:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-02-15 02:55:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 02:55:26,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:55:26,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:26,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 02:55:26,057 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:55:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:55:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-02-15 02:55:26,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:55:26,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440620538] [2022-02-15 02:55:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:55:26,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:55:26,059 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:55:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:55:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:55:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 02:55:26,096 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:55:26,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440620538] [2022-02-15 02:55:26,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1440620538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:55:26,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:55:26,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:55:26,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580753247] [2022-02-15 02:55:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:55:26,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:55:26,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:55:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:55:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:55:26,097 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-02-15 02:55:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:55:26,188 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-02-15 02:55:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:55:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 02:55:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:55:26,190 INFO L225 Difference]: With dead ends: 857 [2022-02-15 02:55:26,190 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 02:55:26,192 INFO L932 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-02-15 02:55:26,193 INFO L933 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-02-15 02:55:26,193 INFO L934 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-02-15 02:55:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 02:55:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 02:55:26,194 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-02-15 02:55:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 02:55:26,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-02-15 02:55:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:55:26,195 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 02:55:26,195 INFO L471 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-02-15 02:55:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 02:55:26,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 02:55:26,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 02:55:26,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 02:55:26,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 02:55:29,552 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 02:55:29,553 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 02:55:29,553 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 02:55:29,553 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,553 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 02:55:29,553 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,553 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,553 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,553 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,554 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 02:55:29,554 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-02-15 02:55:29,554 INFO L861 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-02-15 02:55:29,554 INFO L854 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-02-15 02:55:29,554 INFO L854 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-02-15 02:55:29,554 INFO L861 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-02-15 02:55:29,554 INFO L854 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-02-15 02:55:29,555 INFO L854 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-02-15 02:55:29,555 INFO L854 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-02-15 02:55:29,555 INFO L854 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-02-15 02:55:29,555 INFO L861 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-02-15 02:55:29,555 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-02-15 02:55:29,555 INFO L854 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-02-15 02:55:29,555 INFO L854 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-02-15 02:55:29,556 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-02-15 02:55:29,556 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-02-15 02:55:29,556 INFO L854 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-02-15 02:55:29,556 INFO L854 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-02-15 02:55:29,556 INFO L854 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-02-15 02:55:29,556 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-02-15 02:55:29,557 INFO L854 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-02-15 02:55:29,557 INFO L854 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-02-15 02:55:29,557 INFO L861 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-02-15 02:55:29,557 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-02-15 02:55:29,560 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:55:29,561 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 02:55:29,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 02:55:29 BoogieIcfgContainer [2022-02-15 02:55:29,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 02:55:29,569 INFO L158 Benchmark]: Toolchain (without parser) took 6337.08ms. Allocated memory was 199.2MB in the beginning and 323.0MB in the end (delta: 123.7MB). Free memory was 150.9MB in the beginning and 110.9MB in the end (delta: 40.1MB). Peak memory consumption was 164.5MB. Max. memory is 8.0GB. [2022-02-15 02:55:29,569 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 02:55:29,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.98ms. Allocated memory was 199.2MB in the beginning and 268.4MB in the end (delta: 69.2MB). Free memory was 150.8MB in the beginning and 244.2MB in the end (delta: -93.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-02-15 02:55:29,570 INFO L158 Benchmark]: Boogie Preprocessor took 22.48ms. Allocated memory is still 268.4MB. Free memory was 244.2MB in the beginning and 243.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 02:55:29,570 INFO L158 Benchmark]: RCFGBuilder took 298.79ms. Allocated memory is still 268.4MB. Free memory was 242.7MB in the beginning and 232.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-15 02:55:29,585 INFO L158 Benchmark]: TraceAbstraction took 5760.99ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 231.7MB in the beginning and 110.9MB in the end (delta: 120.8MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. [2022-02-15 02:55:29,586 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.16ms. Allocated memory is still 199.2MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.98ms. Allocated memory was 199.2MB in the beginning and 268.4MB in the end (delta: 69.2MB). Free memory was 150.8MB in the beginning and 244.2MB in the end (delta: -93.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.48ms. Allocated memory is still 268.4MB. Free memory was 244.2MB in the beginning and 243.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 298.79ms. Allocated memory is still 268.4MB. Free memory was 242.7MB in the beginning and 232.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5760.99ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 231.7MB in the beginning and 110.9MB in the end (delta: 120.8MB). Peak memory consumption was 177.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 5.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, 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.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.4s 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-02-15 02:55:29,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...