/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 18:15:34,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 18:15:34,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 18:15:34,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 18:15:34,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 18:15:34,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 18:15:34,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 18:15:34,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 18:15:34,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 18:15:34,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 18:15:34,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 18:15:34,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 18:15:34,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 18:15:34,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 18:15:34,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 18:15:34,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 18:15:34,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 18:15:34,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 18:15:34,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 18:15:34,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 18:15:34,353 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 18:15:34,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 18:15:34,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 18:15:34,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 18:15:34,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 18:15:34,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 18:15:34,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 18:15:34,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 18:15:34,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 18:15:34,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 18:15:34,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 18:15:34,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 18:15:34,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 18:15:34,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 18:15:34,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 18:15:34,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 18:15:34,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 18:15:34,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 18:15:34,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 18:15:34,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 18:15:34,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 18:15:34,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 18:15:34,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 18:15:34,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 18:15:34,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 18:15:34,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 18:15:34,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 18:15:34,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 18:15:34,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 18:15:34,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 18:15:34,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 18:15:34,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 18:15:34,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 18:15:34,374 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 18:15:34,374 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 18:15:34,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 18:15:34,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 18:15:34,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 18:15:34,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 18:15:34,591 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 18:15:34,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-03-20 18:15:34,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3450953ab/1dabe4983dce4f3e8614bdcae6981f37/FLAGdbbd438ee [2022-03-20 18:15:34,941 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 18:15:34,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-03-20 18:15:34,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3450953ab/1dabe4983dce4f3e8614bdcae6981f37/FLAGdbbd438ee [2022-03-20 18:15:35,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3450953ab/1dabe4983dce4f3e8614bdcae6981f37 [2022-03-20 18:15:35,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 18:15:35,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 18:15:35,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 18:15:35,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 18:15:35,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 18:15:35,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ec52ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35, skipping insertion in model container [2022-03-20 18:15:35,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 18:15:35,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 18:15:35,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-03-20 18:15:35,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 18:15:35,545 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 18:15:35,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2022-03-20 18:15:35,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 18:15:35,570 INFO L208 MainTranslator]: Completed translation [2022-03-20 18:15:35,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35 WrapperNode [2022-03-20 18:15:35,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 18:15:35,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 18:15:35,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 18:15:35,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 18:15:35,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 18:15:35,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 18:15:35,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 18:15:35,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 18:15:35,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (1/1) ... [2022-03-20 18:15:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 18:15:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 18:15:35,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 18:15:35,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 18:15:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 18:15:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 18:15:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 18:15:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 18:15:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 18:15:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 18:15:35,706 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 18:15:35,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 18:15:35,845 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 18:15:35,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 18:15:35,850 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 18:15:35,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:15:35 BoogieIcfgContainer [2022-03-20 18:15:35,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 18:15:35,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 18:15:35,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 18:15:35,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 18:15:35,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 06:15:35" (1/3) ... [2022-03-20 18:15:35,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f73f9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:15:35, skipping insertion in model container [2022-03-20 18:15:35,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:15:35" (2/3) ... [2022-03-20 18:15:35,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f73f9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:15:35, skipping insertion in model container [2022-03-20 18:15:35,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:15:35" (3/3) ... [2022-03-20 18:15:35,877 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-03-20 18:15:35,881 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 18:15:35,881 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 18:15:35,919 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 18:15:35,925 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 18:15:35,925 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 18:15:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-20 18:15:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 18:15:35,944 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:35,945 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:35,946 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2022-03-20 18:15:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:35,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [155254014] [2022-03-20 18:15:35,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 2 times [2022-03-20 18:15:35,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:35,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447746764] [2022-03-20 18:15:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:15:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447746764] [2022-03-20 18:15:36,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447746764] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 18:15:36,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [155254014] [2022-03-20 18:15:36,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [155254014] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 18:15:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9743264] [2022-03-20 18:15:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:36,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 18:15:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 18:15:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 18:15:36,199 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:15:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:36,290 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-03-20 18:15:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 18:15:36,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-20 18:15:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:36,305 INFO L225 Difference]: With dead ends: 62 [2022-03-20 18:15:36,305 INFO L226 Difference]: Without dead ends: 30 [2022-03-20 18:15:36,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 18:15:36,310 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:36,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 18:15:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-20 18:15:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-03-20 18:15:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 18:15:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-03-20 18:15:36,342 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-03-20 18:15:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:36,343 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-03-20 18:15:36,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:15:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-03-20 18:15:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 18:15:36,344 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:36,344 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:36,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 18:15:36,345 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2022-03-20 18:15:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708230824] [2022-03-20 18:15:36,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 2 times [2022-03-20 18:15:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925792125] [2022-03-20 18:15:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:15:36,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925792125] [2022-03-20 18:15:36,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925792125] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:15:36,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:36,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708230824] [2022-03-20 18:15:36,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708230824] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 18:15:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060523381] [2022-03-20 18:15:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:36,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 18:15:36,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 18:15:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 18:15:36,421 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:15:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:36,523 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-03-20 18:15:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 18:15:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-20 18:15:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:36,524 INFO L225 Difference]: With dead ends: 36 [2022-03-20 18:15:36,524 INFO L226 Difference]: Without dead ends: 34 [2022-03-20 18:15:36,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 18:15:36,526 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:36,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:15:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-20 18:15:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-20 18:15:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-03-20 18:15:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-03-20 18:15:36,546 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-03-20 18:15:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:36,547 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-03-20 18:15:36,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 18:15:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-03-20 18:15:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-20 18:15:36,547 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:36,547 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:36,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 18:15:36,548 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2022-03-20 18:15:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127177231] [2022-03-20 18:15:36,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 2 times [2022-03-20 18:15:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147482892] [2022-03-20 18:15:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 18:15:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 18:15:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:36,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147482892] [2022-03-20 18:15:36,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147482892] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:15:36,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:36,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127177231] [2022-03-20 18:15:36,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127177231] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:15:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196130771] [2022-03-20 18:15:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:36,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 18:15:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 18:15:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-20 18:15:36,646 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 18:15:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:36,804 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-03-20 18:15:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 18:15:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-03-20 18:15:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:36,806 INFO L225 Difference]: With dead ends: 49 [2022-03-20 18:15:36,806 INFO L226 Difference]: Without dead ends: 47 [2022-03-20 18:15:36,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 18:15:36,807 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:36,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:15:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-20 18:15:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-03-20 18:15:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 18:15:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-03-20 18:15:36,815 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-03-20 18:15:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:36,816 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-03-20 18:15:36,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 18:15:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-03-20 18:15:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 18:15:36,817 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:36,817 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:36,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 18:15:36,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2022-03-20 18:15:36,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598676586] [2022-03-20 18:15:36,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 2 times [2022-03-20 18:15:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:36,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388366535] [2022-03-20 18:15:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 18:15:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 18:15:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 18:15:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:36,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388366535] [2022-03-20 18:15:36,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388366535] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:15:36,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:36,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598676586] [2022-03-20 18:15:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598676586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:36,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:36,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 18:15:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961398905] [2022-03-20 18:15:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:36,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 18:15:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 18:15:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-20 18:15:36,901 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 18:15:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:37,074 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-03-20 18:15:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 18:15:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-20 18:15:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:37,078 INFO L225 Difference]: With dead ends: 56 [2022-03-20 18:15:37,078 INFO L226 Difference]: Without dead ends: 54 [2022-03-20 18:15:37,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 18:15:37,085 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:37,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:15:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-20 18:15:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-03-20 18:15:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 18:15:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-03-20 18:15:37,101 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-03-20 18:15:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:37,101 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-03-20 18:15:37,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 18:15:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-03-20 18:15:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-20 18:15:37,102 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:37,103 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:37,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 18:15:37,105 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2022-03-20 18:15:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559951794] [2022-03-20 18:15:37,107 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 2 times [2022-03-20 18:15:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864048282] [2022-03-20 18:15:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 18:15:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 18:15:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-20 18:15:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 18:15:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864048282] [2022-03-20 18:15:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864048282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:37,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:37,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 18:15:37,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:37,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1559951794] [2022-03-20 18:15:37,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1559951794] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:37,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:37,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 18:15:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524719049] [2022-03-20 18:15:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:37,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 18:15:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 18:15:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-20 18:15:37,174 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 18:15:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:37,369 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-03-20 18:15:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 18:15:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-03-20 18:15:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:37,372 INFO L225 Difference]: With dead ends: 75 [2022-03-20 18:15:37,372 INFO L226 Difference]: Without dead ends: 68 [2022-03-20 18:15:37,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 18:15:37,373 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:37,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:15:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-20 18:15:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-03-20 18:15:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-20 18:15:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-03-20 18:15:37,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-03-20 18:15:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:37,388 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-03-20 18:15:37,388 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 18:15:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-03-20 18:15:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 18:15:37,389 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:37,389 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:37,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 18:15:37,389 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2022-03-20 18:15:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:37,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337247429] [2022-03-20 18:15:37,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 18:15:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 2 times [2022-03-20 18:15:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:37,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033580196] [2022-03-20 18:15:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 18:15:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 18:15:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-03-20 18:15:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 18:15:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033580196] [2022-03-20 18:15:37,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033580196] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:37,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 18:15:37,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337247429] [2022-03-20 18:15:37,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337247429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:37,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 18:15:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131115932] [2022-03-20 18:15:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:37,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 18:15:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:37,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 18:15:37,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 18:15:37,468 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 18:15:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:37,669 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-03-20 18:15:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 18:15:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-03-20 18:15:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:37,670 INFO L225 Difference]: With dead ends: 77 [2022-03-20 18:15:37,670 INFO L226 Difference]: Without dead ends: 75 [2022-03-20 18:15:37,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-20 18:15:37,671 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:37,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 18:15:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-20 18:15:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-03-20 18:15:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-20 18:15:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-03-20 18:15:37,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-03-20 18:15:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:37,680 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-03-20 18:15:37,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 18:15:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-03-20 18:15:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 18:15:37,681 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:37,681 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:37,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 18:15:37,682 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2022-03-20 18:15:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519398901] [2022-03-20 18:15:44,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 18:15:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1785103362, now seen corresponding path program 1 times [2022-03-20 18:15:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:44,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176637166] [2022-03-20 18:15:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 18:15:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 18:15:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-03-20 18:15:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 18:15:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:44,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176637166] [2022-03-20 18:15:44,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176637166] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:44,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:44,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 18:15:44,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:44,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519398901] [2022-03-20 18:15:44,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519398901] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:44,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:44,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-20 18:15:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454577455] [2022-03-20 18:15:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:44,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 18:15:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 18:15:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-03-20 18:15:44,969 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-20 18:15:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:45,445 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-03-20 18:15:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-20 18:15:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-03-20 18:15:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:45,447 INFO L225 Difference]: With dead ends: 76 [2022-03-20 18:15:45,447 INFO L226 Difference]: Without dead ends: 67 [2022-03-20 18:15:45,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2022-03-20 18:15:45,449 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:45,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 106 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 366 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2022-03-20 18:15:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-20 18:15:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2022-03-20 18:15:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-03-20 18:15:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-03-20 18:15:45,457 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 57 [2022-03-20 18:15:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:45,457 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-03-20 18:15:45,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.434782608695652) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-20 18:15:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-03-20 18:15:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 18:15:45,458 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 18:15:45,458 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 18:15:45,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 18:15:45,458 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 18:15:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 18:15:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2022-03-20 18:15:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:45,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767714850] [2022-03-20 18:15:45,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 18:15:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash 188680091, now seen corresponding path program 1 times [2022-03-20 18:15:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 18:15:45,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668660750] [2022-03-20 18:15:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 18:15:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 18:15:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 18:15:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 18:15:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 18:15:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-20 18:15:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 18:15:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 18:15:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 18:15:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668660750] [2022-03-20 18:15:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668660750] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:45,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:45,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 18:15:46,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 18:15:46,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767714850] [2022-03-20 18:15:46,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767714850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 18:15:46,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 18:15:46,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-03-20 18:15:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596743454] [2022-03-20 18:15:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 18:15:46,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 18:15:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 18:15:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 18:15:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-03-20 18:15:46,152 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-20 18:15:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 18:15:46,500 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-03-20 18:15:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 18:15:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2022-03-20 18:15:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 18:15:46,501 INFO L225 Difference]: With dead ends: 58 [2022-03-20 18:15:46,501 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 18:15:46,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2022-03-20 18:15:46,503 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 18:15:46,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 126 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 206 Invalid, 0 Unknown, 5 Unchecked, 0.1s Time] [2022-03-20 18:15:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 18:15:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 18:15:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 18:15:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 18:15:46,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-03-20 18:15:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 18:15:46,504 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 18:15:46,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-03-20 18:15:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 18:15:46,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 18:15:46,506 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 18:15:46,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 18:15:46,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 18:15:47,156 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-03-20 18:15:47,156 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-03-20 18:15:47,156 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-03-20 18:15:47,156 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-03-20 18:15:47,156 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:15:47,157 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:15:47,157 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-03-20 18:15:47,157 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-03-20 18:15:47,157 INFO L878 garLoopResultBuilder]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2022-03-20 18:15:47,157 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2022-03-20 18:15:47,157 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-03-20 18:15:47,157 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-03-20 18:15:47,157 INFO L878 garLoopResultBuilder]: At program point L44(lines 44 45) the Hoare annotation is: (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2022-03-20 18:15:47,157 INFO L878 garLoopResultBuilder]: At program point L32(lines 25 56) the Hoare annotation is: (and (<= 1 main_~inlen~0) (<= 2 main_~bufferlen~0)) [2022-03-20 18:15:47,157 INFO L885 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0))) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) (not (= main_~buf~0 main_~buflim~0)) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) (not (= main_~buf~0 main_~buflim~0)) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 37 48) the Hoare annotation is: (and (= main_~in~0 0) (<= 0 (+ 2147483648 |main_#t~nondet3|)) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) (<= |main_#t~nondet3| 2147483647) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0))) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (<= 2 main_~bufferlen~0)) (.cse2 (<= 0 main_~buf~0))) (or (and .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse1 .cse2))))) (or (and (= main_~buf~0 0) .cse0) (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (< main_~in~0 main_~inlen~0) (<= 3 main_~inlen~0) .cse0))) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= (+ 2 main_~in~0) main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= (+ 2 main_~in~0) main_~inlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2022-03-20 18:15:47,158 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2022-03-20 18:15:47,158 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (= main_~in~0 0) (<= 0 main_~buf~0) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L878 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= (+ 2 main_~in~0) main_~inlen~0) (< main_~buf~0 (+ main_~bufferlen~0 1))) (and (= main_~in~0 0) .cse0 (= main_~buf~0 0) (<= 3 main_~inlen~0)))) [2022-03-20 18:15:47,159 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 40) the Hoare annotation is: (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) (<= 3 main_~inlen~0)) [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 18:15:47,159 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2022-03-20 18:15:47,160 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-03-20 18:15:47,160 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2022-03-20 18:15:47,160 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-20 18:15:47,160 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-20 18:15:47,160 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2022-03-20 18:15:47,162 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-03-20 18:15:47,163 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 18:15:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 06:15:47 BoogieIcfgContainer [2022-03-20 18:15:47,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 18:15:47,174 INFO L158 Benchmark]: Toolchain (without parser) took 11794.04ms. Allocated memory was 191.9MB in the beginning and 234.9MB in the end (delta: 43.0MB). Free memory was 143.1MB in the beginning and 84.1MB in the end (delta: 59.0MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2022-03-20 18:15:47,174 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 191.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 18:15:47,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.82ms. Allocated memory is still 191.9MB. Free memory was 142.9MB in the beginning and 169.7MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 18:15:47,175 INFO L158 Benchmark]: Boogie Preprocessor took 19.42ms. Allocated memory is still 191.9MB. Free memory was 169.7MB in the beginning and 168.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 18:15:47,175 INFO L158 Benchmark]: RCFGBuilder took 248.12ms. Allocated memory is still 191.9MB. Free memory was 168.4MB in the beginning and 157.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 18:15:47,175 INFO L158 Benchmark]: TraceAbstraction took 11320.48ms. Allocated memory was 191.9MB in the beginning and 234.9MB in the end (delta: 43.0MB). Free memory was 156.9MB in the beginning and 84.1MB in the end (delta: 72.8MB). Peak memory consumption was 117.4MB. Max. memory is 8.0GB. [2022-03-20 18:15:47,176 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.15ms. Allocated memory is still 191.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.82ms. Allocated memory is still 191.9MB. Free memory was 142.9MB in the beginning and 169.7MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.42ms. Allocated memory is still 191.9MB. Free memory was 169.7MB in the beginning and 168.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.12ms. Allocated memory is still 191.9MB. Free memory was 168.4MB in the beginning and 157.1MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11320.48ms. Allocated memory was 191.9MB in the beginning and 234.9MB in the end (delta: 43.0MB). Free memory was 156.9MB in the beginning and 84.1MB in the end (delta: 72.8MB). Peak memory consumption was 117.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 531 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 108 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1389 IncrementalHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 229 mSDtfsCounter, 1389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 186 PreInvPairs, 266 NumberOfFragments, 440 HoareAnnotationTreeSize, 186 FomulaSimplifications, 401 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 2960 FormulaSimplificationTreeSizeReductionInter, 0.6s 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((2 <= bufferlen && 1 <= in) && 0 <= buf) && 2 + in <= inlen) && buf < bufferlen + 1) || (((in == 0 && 2 <= bufferlen) && buf == 0) && 3 <= inlen) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == 0 || !(cond == 0)) && (!(\old(cond) == 1) || \old(cond) == cond) RESULT: Ultimate proved your program to be correct! [2022-03-20 18:15:47,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...