/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-34549b5 [2022-04-06 18:55:00,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 18:55:00,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 18:55:00,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 18:55:00,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 18:55:00,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 18:55:00,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 18:55:00,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 18:55:00,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 18:55:00,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 18:55:00,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 18:55:00,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 18:55:00,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 18:55:00,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 18:55:00,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 18:55:00,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 18:55:00,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 18:55:00,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 18:55:00,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 18:55:00,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 18:55:00,289 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 18:55:00,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 18:55:00,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 18:55:00,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 18:55:00,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 18:55:00,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 18:55:00,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 18:55:00,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 18:55:00,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 18:55:00,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 18:55:00,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 18:55:00,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 18:55:00,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 18:55:00,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 18:55:00,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 18:55:00,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 18:55:00,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 18:55:00,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 18:55:00,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 18:55:00,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 18:55:00,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 18:55:00,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 18:55:00,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 18:55:00,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 18:55:00,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 18:55:00,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 18:55:00,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 18:55:00,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 18:55:00,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 18:55:00,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 18:55:00,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 18:55:00,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 18:55:00,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 18:55:00,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:55:00,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 18:55:00,318 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 18:55:00,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 18:55:00,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 18:55:00,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 18:55:00,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 18:55:00,546 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 18:55:00,547 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-04-06 18:55:00,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c287c499/96a8439a81a6401fa062e5a785c0054d/FLAG541c9f9fb [2022-04-06 18:55:00,884 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 18:55:00,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-06 18:55:00,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c287c499/96a8439a81a6401fa062e5a785c0054d/FLAG541c9f9fb [2022-04-06 18:55:01,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c287c499/96a8439a81a6401fa062e5a785c0054d [2022-04-06 18:55:01,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 18:55:01,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 18:55:01,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 18:55:01,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 18:55:01,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 18:55:01,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1529019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01, skipping insertion in model container [2022-04-06 18:55:01,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 18:55:01,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 18:55:01,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-04-06 18:55:01,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:55:01,467 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 18:55:01,477 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-04-06 18:55:01,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:55:01,485 INFO L208 MainTranslator]: Completed translation [2022-04-06 18:55:01,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01 WrapperNode [2022-04-06 18:55:01,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 18:55:01,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 18:55:01,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 18:55:01,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 18:55:01,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 18:55:01,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 18:55:01,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 18:55:01,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 18:55:01,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (1/1) ... [2022-04-06 18:55:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:55:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:55:01,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 18:55:01,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 18:55:01,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 18:55:01,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 18:55:01,579 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 18:55:01,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 18:55:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 18:55:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 18:55:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 18:55:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 18:55:01,621 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 18:55:01,622 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 18:55:01,762 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 18:55:01,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 18:55:01,767 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 18:55:01,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:55:01 BoogieIcfgContainer [2022-04-06 18:55:01,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 18:55:01,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 18:55:01,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 18:55:01,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 18:55:01,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 06:55:01" (1/3) ... [2022-04-06 18:55:01,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24181947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:55:01, skipping insertion in model container [2022-04-06 18:55:01,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:55:01" (2/3) ... [2022-04-06 18:55:01,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24181947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:55:01, skipping insertion in model container [2022-04-06 18:55:01,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:55:01" (3/3) ... [2022-04-06 18:55:01,774 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-06 18:55:01,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 18:55:01,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 18:55:01,845 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 18:55:01,856 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 18:55:01,856 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 18:55:01,877 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-04-06 18:55:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 18:55:01,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:01,889 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:01,890 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-06 18:55:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:01,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594719570] [2022-04-06 18:55:01,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-04-06 18:55:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:01,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040090118] [2022-04-06 18:55:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040090118] [2022-04-06 18:55:02,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040090118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594719570] [2022-04-06 18:55:02,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594719570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254955169] [2022-04-06 18:55:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,119 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-04-06 18:55:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,201 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-06 18:55:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,204 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-04-06 18:55:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,209 INFO L225 Difference]: With dead ends: 58 [2022-04-06 18:55:02,209 INFO L226 Difference]: Without dead ends: 43 [2022-04-06 18:55:02,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,213 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:55:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-06 18:55:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-06 18:55:02,236 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-04-06 18:55:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-06 18:55:02,238 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-06 18:55:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,238 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-06 18:55:02,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-06 18:55:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 18:55:02,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,239 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 18:55:02,240 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-06 18:55:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512274268] [2022-04-06 18:55:02,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-04-06 18:55:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564637933] [2022-04-06 18:55:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564637933] [2022-04-06 18:55:02,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564637933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512274268] [2022-04-06 18:55:02,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512274268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723352895] [2022-04-06 18:55:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,281 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-04-06 18:55:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,344 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-06 18:55:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,344 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-04-06 18:55:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,345 INFO L225 Difference]: With dead ends: 68 [2022-04-06 18:55:02,345 INFO L226 Difference]: Without dead ends: 43 [2022-04-06 18:55:02,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,347 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-06 18:55:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-06 18:55:02,354 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-04-06 18:55:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-06 18:55:02,355 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-06 18:55:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,355 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-06 18:55:02,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-06 18:55:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 18:55:02,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,356 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 18:55:02,356 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-06 18:55:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469709673] [2022-04-06 18:55:02,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-04-06 18:55:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584295700] [2022-04-06 18:55:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584295700] [2022-04-06 18:55:02,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584295700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469709673] [2022-04-06 18:55:02,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469709673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985577520] [2022-04-06 18:55:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,419 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-04-06 18:55:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,482 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-06 18:55:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,483 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-04-06 18:55:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,485 INFO L225 Difference]: With dead ends: 64 [2022-04-06 18:55:02,485 INFO L226 Difference]: Without dead ends: 46 [2022-04-06 18:55:02,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,488 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-06 18:55:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-06 18:55:02,505 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-04-06 18:55:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-06 18:55:02,508 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-06 18:55:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,509 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-06 18:55:02,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-06 18:55:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 18:55:02,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,511 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 18:55:02,513 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-06 18:55:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730858512] [2022-04-06 18:55:02,517 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-04-06 18:55:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344933531] [2022-04-06 18:55:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344933531] [2022-04-06 18:55:02,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344933531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730858512] [2022-04-06 18:55:02,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730858512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610921601] [2022-04-06 18:55:02,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,557 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-04-06 18:55:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,614 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-06 18:55:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,614 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-04-06 18:55:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,617 INFO L225 Difference]: With dead ends: 112 [2022-04-06 18:55:02,617 INFO L226 Difference]: Without dead ends: 77 [2022-04-06 18:55:02,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,621 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-06 18:55:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-06 18:55:02,639 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-04-06 18:55:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-06 18:55:02,642 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-06 18:55:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,642 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-06 18:55:02,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-06 18:55:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 18:55:02,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,643 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 18:55:02,644 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-06 18:55:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65430386] [2022-04-06 18:55:02,648 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-04-06 18:55:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497365981] [2022-04-06 18:55:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497365981] [2022-04-06 18:55:02,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497365981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65430386] [2022-04-06 18:55:02,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65430386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961411110] [2022-04-06 18:55:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,689 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-04-06 18:55:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,733 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-06 18:55:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,733 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-04-06 18:55:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,734 INFO L225 Difference]: With dead ends: 95 [2022-04-06 18:55:02,734 INFO L226 Difference]: Without dead ends: 93 [2022-04-06 18:55:02,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,735 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-06 18:55:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-06 18:55:02,750 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-04-06 18:55:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-06 18:55:02,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-06 18:55:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,752 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-06 18:55:02,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-06 18:55:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 18:55:02,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,753 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 18:55:02,753 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-06 18:55:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073269147] [2022-04-06 18:55:02,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-04-06 18:55:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093066330] [2022-04-06 18:55:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093066330] [2022-04-06 18:55:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093066330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073269147] [2022-04-06 18:55:02,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073269147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623722525] [2022-04-06 18:55:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,798 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-04-06 18:55:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,843 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-06 18:55:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,843 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-04-06 18:55:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,844 INFO L225 Difference]: With dead ends: 131 [2022-04-06 18:55:02,844 INFO L226 Difference]: Without dead ends: 129 [2022-04-06 18:55:02,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,846 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-06 18:55:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-06 18:55:02,871 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-04-06 18:55:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-06 18:55:02,872 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-06 18:55:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,872 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-06 18:55:02,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-06 18:55:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 18:55:02,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,877 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 18:55:02,877 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-06 18:55:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541754870] [2022-04-06 18:55:02,878 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-04-06 18:55:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909910460] [2022-04-06 18:55:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909910460] [2022-04-06 18:55:02,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909910460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541754870] [2022-04-06 18:55:02,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541754870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:02,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:02,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74355620] [2022-04-06 18:55:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:02,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:02,933 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-04-06 18:55:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:02,983 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-06 18:55:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:02,983 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-04-06 18:55:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:02,984 INFO L225 Difference]: With dead ends: 231 [2022-04-06 18:55:02,984 INFO L226 Difference]: Without dead ends: 137 [2022-04-06 18:55:02,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:02,985 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:02,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-06 18:55:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-06 18:55:02,995 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-04-06 18:55:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-06 18:55:02,996 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-06 18:55:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:02,996 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-06 18:55:02,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-06 18:55:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 18:55:02,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:02,997 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:02,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 18:55:02,997 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-06 18:55:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:02,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543458902] [2022-04-06 18:55:02,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-04-06 18:55:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:02,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982314907] [2022-04-06 18:55:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982314907] [2022-04-06 18:55:03,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982314907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543458902] [2022-04-06 18:55:03,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543458902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377462191] [2022-04-06 18:55:03,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,046 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-04-06 18:55:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,090 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-06 18:55:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-06 18:55:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,091 INFO L225 Difference]: With dead ends: 205 [2022-04-06 18:55:03,091 INFO L226 Difference]: Without dead ends: 143 [2022-04-06 18:55:03,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,093 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-06 18:55:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-06 18:55:03,107 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-04-06 18:55:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-06 18:55:03,108 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-06 18:55:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,109 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-06 18:55:03,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-06 18:55:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 18:55:03,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:03,109 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:03,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 18:55:03,110 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-06 18:55:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484418197] [2022-04-06 18:55:03,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-04-06 18:55:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255970447] [2022-04-06 18:55:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255970447] [2022-04-06 18:55:03,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255970447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484418197] [2022-04-06 18:55:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484418197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499354476] [2022-04-06 18:55:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,153 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-04-06 18:55:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,197 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-06 18:55:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-06 18:55:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,199 INFO L225 Difference]: With dead ends: 237 [2022-04-06 18:55:03,199 INFO L226 Difference]: Without dead ends: 235 [2022-04-06 18:55:03,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,201 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-06 18:55:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-06 18:55:03,213 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-04-06 18:55:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-06 18:55:03,213 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-06 18:55:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,214 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-06 18:55:03,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-06 18:55:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 18:55:03,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:03,214 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:03,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 18:55:03,214 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-06 18:55:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433106127] [2022-04-06 18:55:03,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-04-06 18:55:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:03,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564086418] [2022-04-06 18:55:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564086418] [2022-04-06 18:55:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564086418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433106127] [2022-04-06 18:55:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433106127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045798615] [2022-04-06 18:55:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,254 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-04-06 18:55:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,304 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-06 18:55:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-06 18:55:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,305 INFO L225 Difference]: With dead ends: 445 [2022-04-06 18:55:03,305 INFO L226 Difference]: Without dead ends: 259 [2022-04-06 18:55:03,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,308 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-06 18:55:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-06 18:55:03,324 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-04-06 18:55:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-06 18:55:03,324 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-06 18:55:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,325 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-06 18:55:03,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-06 18:55:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 18:55:03,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:03,325 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:03,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 18:55:03,326 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-06 18:55:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966946219] [2022-04-06 18:55:03,326 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-04-06 18:55:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:03,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796468586] [2022-04-06 18:55:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796468586] [2022-04-06 18:55:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796468586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966946219] [2022-04-06 18:55:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966946219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621234311] [2022-04-06 18:55:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,371 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-04-06 18:55:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,425 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-06 18:55:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-06 18:55:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,426 INFO L225 Difference]: With dead ends: 385 [2022-04-06 18:55:03,426 INFO L226 Difference]: Without dead ends: 267 [2022-04-06 18:55:03,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,427 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-06 18:55:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-06 18:55:03,451 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-04-06 18:55:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-06 18:55:03,452 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-06 18:55:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,452 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-06 18:55:03,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-06 18:55:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 18:55:03,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:03,453 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:03,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 18:55:03,453 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-06 18:55:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457820273] [2022-04-06 18:55:03,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-04-06 18:55:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:03,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471863707] [2022-04-06 18:55:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471863707] [2022-04-06 18:55:03,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471863707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457820273] [2022-04-06 18:55:03,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457820273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718740297] [2022-04-06 18:55:03,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,491 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-04-06 18:55:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,542 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-06 18:55:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-06 18:55:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,544 INFO L225 Difference]: With dead ends: 427 [2022-04-06 18:55:03,544 INFO L226 Difference]: Without dead ends: 425 [2022-04-06 18:55:03,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,545 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-06 18:55:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-06 18:55:03,569 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-04-06 18:55:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-06 18:55:03,570 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-06 18:55:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,575 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-06 18:55:03,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-06 18:55:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 18:55:03,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:55:03,576 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:55:03,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 18:55:03,576 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:55:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:55:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-06 18:55:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141033649] [2022-04-06 18:55:03,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:55:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-04-06 18:55:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:55:03,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366699535] [2022-04-06 18:55:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:55:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:55:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:55:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:55:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:55:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:55:03,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366699535] [2022-04-06 18:55:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366699535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:55:03,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141033649] [2022-04-06 18:55:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141033649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:55:03,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:55:03,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:55:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753552278] [2022-04-06 18:55:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:55:03,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:55:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:55:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:55:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:55:03,604 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-04-06 18:55:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:55:03,660 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-06 18:55:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:55:03,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-06 18:55:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:55:03,662 INFO L225 Difference]: With dead ends: 857 [2022-04-06 18:55:03,662 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 18:55:03,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:55:03,664 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:55:03,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:55:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 18:55:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 18:55:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-06 18:55:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 18:55:03,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-06 18:55:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:55:03,665 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 18:55:03,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:55:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 18:55:03,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 18:55:03,667 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 18:55:03,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 18:55:03,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 18:55:06,305 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-06 18:55:06,305 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-06 18:55:06,305 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-06 18:55:06,306 INFO L878 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-04-06 18:55:06,306 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-04-06 18:55:06,306 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-04-06 18:55:06,307 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-06 18:55:06,307 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-04-06 18:55:06,307 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-04-06 18:55:06,307 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-04-06 18:55:06,308 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-04-06 18:55:06,308 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-06 18:55:06,310 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-06 18:55:06,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 18:55:06,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:55:06 BoogieIcfgContainer [2022-04-06 18:55:06,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 18:55:06,318 INFO L158 Benchmark]: Toolchain (without parser) took 4992.14ms. Allocated memory was 210.8MB in the beginning and 327.2MB in the end (delta: 116.4MB). Free memory was 162.8MB in the beginning and 241.5MB in the end (delta: -78.7MB). Peak memory consumption was 165.4MB. Max. memory is 8.0GB. [2022-04-06 18:55:06,318 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 18:55:06,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.31ms. Allocated memory is still 210.8MB. Free memory was 162.6MB in the beginning and 188.0MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-06 18:55:06,319 INFO L158 Benchmark]: Boogie Preprocessor took 32.28ms. Allocated memory is still 210.8MB. Free memory was 188.0MB in the beginning and 186.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 18:55:06,319 INFO L158 Benchmark]: RCFGBuilder took 249.06ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 176.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 18:55:06,319 INFO L158 Benchmark]: TraceAbstraction took 4548.48ms. Allocated memory was 210.8MB in the beginning and 327.2MB in the end (delta: 116.4MB). Free memory was 175.4MB in the beginning and 241.5MB in the end (delta: -66.1MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. [2022-04-06 18:55:06,320 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.09ms. Allocated memory is still 210.8MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.31ms. Allocated memory is still 210.8MB. Free memory was 162.6MB in the beginning and 188.0MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.28ms. Allocated memory is still 210.8MB. Free memory was 188.0MB in the beginning and 186.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.06ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 176.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4548.48ms. Allocated memory was 210.8MB in the beginning and 327.2MB in the end (delta: 116.4MB). Free memory was 175.4MB in the beginning and 241.5MB in the end (delta: -66.1MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 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-04-06 18:55:06,348 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...