/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:56:42,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:56:42,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:56:42,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:56:42,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:56:42,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:56:42,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:56:42,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:56:42,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:56:42,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:56:42,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:56:42,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:56:42,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:56:42,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:56:42,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:56:42,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:56:42,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:56:42,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:56:42,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:56:42,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:56:42,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:56:42,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:56:42,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:56:42,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:56:42,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:56:42,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:56:42,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:56:42,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:56:42,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:56:42,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:56:42,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:56:42,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:56:42,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:56:42,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:56:42,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:56:42,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:56:42,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:56:42,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:56:42,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:56:42,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:56:42,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:56:42,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:56:42,851 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:56:42,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:56:42,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:56:42,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:56:42,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:56:42,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:56:42,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:56:42,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:56:42,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:56:42,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:56:42,855 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:56:42,855 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-01-31 20:56:43,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:56:43,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:56:43,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:56:43,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:56:43,032 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:56:43,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-01-31 20:56:43,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e9a08b5/b93b1fed611b4d4ca4ffff4a50876c7b/FLAGc779e2198 [2022-01-31 20:56:43,396 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:56:43,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-01-31 20:56:43,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e9a08b5/b93b1fed611b4d4ca4ffff4a50876c7b/FLAGc779e2198 [2022-01-31 20:56:43,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e9a08b5/b93b1fed611b4d4ca4ffff4a50876c7b [2022-01-31 20:56:43,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:56:43,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:56:43,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:56:43,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:56:43,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:56:43,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb0dc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43, skipping insertion in model container [2022-01-31 20:56:43,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:56:43,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:56:43,586 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/apache-escape-absolute.i[893,906] [2022-01-31 20:56:43,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:56:43,609 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:56:43,619 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/apache-escape-absolute.i[893,906] [2022-01-31 20:56:43,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:56:43,638 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:56:43,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43 WrapperNode [2022-01-31 20:56:43,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:56:43,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:56:43,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:56:43,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:56:43,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:56:43,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:56:43,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:56:43,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:56:43,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (1/1) ... [2022-01-31 20:56:43,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:56:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:56:43,721 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-01-31 20:56:43,740 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-01-31 20:56:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:56:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:56:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:56:43,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:56:43,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:56:43,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:56:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:56:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:56:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:56:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:56:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:56:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:56:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:56:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:56:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:56:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:56:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:56:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:56:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:56:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:56:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:56:43,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:56:43,804 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:56:43,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:56:43,940 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:56:43,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:56:43,946 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 20:56:43,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:56:43 BoogieIcfgContainer [2022-01-31 20:56:43,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:56:43,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:56:43,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:56:43,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:56:43,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:56:43" (1/3) ... [2022-01-31 20:56:43,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7646ba20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:56:43, skipping insertion in model container [2022-01-31 20:56:43,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:56:43" (2/3) ... [2022-01-31 20:56:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7646ba20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:56:43, skipping insertion in model container [2022-01-31 20:56:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:56:43" (3/3) ... [2022-01-31 20:56:43,954 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-01-31 20:56:43,957 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:56:43,957 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:56:43,990 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:56:44,001 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:56:44,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:56:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-01-31 20:56:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 20:56:44,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:44,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:56:44,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:44,039 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2022-01-31 20:56:44,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:44,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060394388] [2022-01-31 20:56:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:44,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:44,089 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:56:44,259 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:44,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060394388] [2022-01-31 20:56:44,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1060394388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:44,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:44,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:56:44,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573518922] [2022-01-31 20:56:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:44,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:56:44,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:56:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:56:44,282 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-01-31 20:56:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:44,637 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-01-31 20:56:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:56:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-01-31 20:56:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:44,653 INFO L225 Difference]: With dead ends: 112 [2022-01-31 20:56:44,653 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 20:56:44,655 INFO L932 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-01-31 20:56:44,658 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:44,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:56:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 20:56:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-01-31 20:56:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 20:56:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-01-31 20:56:44,692 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-01-31 20:56:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:44,692 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-01-31 20:56:44,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-01-31 20:56:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-01-31 20:56:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 20:56:44,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:44,694 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:56:44,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:56:44,694 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2022-01-31 20:56:44,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:44,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562658620] [2022-01-31 20:56:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:44,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:44,697 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:56:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:56:44,755 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:44,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562658620] [2022-01-31 20:56:44,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [562658620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:44,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:44,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:56:44,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97336742] [2022-01-31 20:56:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:44,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:56:44,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:56:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:56:44,757 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-01-31 20:56:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:45,003 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-01-31 20:56:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:56:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-01-31 20:56:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:45,006 INFO L225 Difference]: With dead ends: 63 [2022-01-31 20:56:45,006 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 20:56:45,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:56:45,008 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:45,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 66 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:56:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 20:56:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-31 20:56:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 20:56:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-01-31 20:56:45,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-01-31 20:56:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:45,025 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-01-31 20:56:45,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-01-31 20:56:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-01-31 20:56:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 20:56:45,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:45,027 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 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-01-31 20:56:45,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:56:45,027 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2022-01-31 20:56:45,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805145587] [2022-01-31 20:56:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:45,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:45,030 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:56:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:56:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 20:56:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 20:56:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 20:56:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 20:56:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 20:56:45,139 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:45,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805145587] [2022-01-31 20:56:45,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [805145587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:45,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:45,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:56:45,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893879030] [2022-01-31 20:56:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:45,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:56:45,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:56:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:56:45,141 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 20:56:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:45,260 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-01-31 20:56:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 20:56:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-01-31 20:56:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:45,262 INFO L225 Difference]: With dead ends: 90 [2022-01-31 20:56:45,262 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 20:56:45,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:56:45,263 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:45,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:56:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 20:56:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-31 20:56:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 20:56:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-01-31 20:56:45,275 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-01-31 20:56:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:45,275 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-01-31 20:56:45,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 20:56:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-01-31 20:56:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 20:56:45,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:45,277 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 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-01-31 20:56:45,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:56:45,277 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2022-01-31 20:56:45,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:45,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800497242] [2022-01-31 20:56:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:45,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:45,279 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:56:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:56:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 20:56:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 20:56:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 20:56:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 20:56:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 20:56:45,392 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:45,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800497242] [2022-01-31 20:56:45,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [800497242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:45,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:45,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:56:45,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861562977] [2022-01-31 20:56:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:45,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:56:45,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:45,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:56:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:56:45,394 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 20:56:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:45,590 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-01-31 20:56:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:56:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-01-31 20:56:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:45,592 INFO L225 Difference]: With dead ends: 68 [2022-01-31 20:56:45,592 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 20:56:45,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:56:45,593 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:45,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:56:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 20:56:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-01-31 20:56:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 20:56:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-01-31 20:56:45,602 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-01-31 20:56:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:45,603 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-01-31 20:56:45,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 20:56:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-01-31 20:56:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-31 20:56:45,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:45,605 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:56:45,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:56:45,605 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2022-01-31 20:56:45,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:45,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [924900187] [2022-01-31 20:56:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:45,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:45,607 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:56:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:56:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 20:56:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 20:56:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 20:56:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 20:56:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 20:56:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 20:56:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 20:56:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 20:56:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 20:56:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 20:56:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-31 20:56:45,690 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:45,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [924900187] [2022-01-31 20:56:45,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [924900187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:45,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:45,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:56:45,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437633620] [2022-01-31 20:56:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:45,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:56:45,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:45,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:56:45,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:56:45,692 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 20:56:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:45,892 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-01-31 20:56:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:56:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-01-31 20:56:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:45,893 INFO L225 Difference]: With dead ends: 74 [2022-01-31 20:56:45,893 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 20:56:45,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:56:45,894 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:45,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 72 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:56:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 20:56:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-01-31 20:56:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 20:56:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-01-31 20:56:45,903 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-01-31 20:56:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:45,904 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-01-31 20:56:45,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 20:56:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-01-31 20:56:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 20:56:45,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:56:45,907 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:56:45,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:56:45,907 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:56:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:56:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2022-01-31 20:56:45,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:56:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536883944] [2022-01-31 20:56:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:56:45,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:56:45,909 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:56:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:56:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 20:56:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 20:56:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 20:56:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 20:56:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 20:56:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 20:56:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 20:56:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 20:56:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 20:56:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 20:56:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 20:56:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 20:56:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 20:56:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:56:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-31 20:56:46,040 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:56:46,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536883944] [2022-01-31 20:56:46,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [536883944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:56:46,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:56:46,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:56:46,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509803313] [2022-01-31 20:56:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:56:46,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:56:46,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:56:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:56:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:56:46,042 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-31 20:56:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:56:46,253 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-01-31 20:56:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:56:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-01-31 20:56:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:56:46,255 INFO L225 Difference]: With dead ends: 75 [2022-01-31 20:56:46,255 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:56:46,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 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-01-31 20:56:46,257 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:56:46,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:56:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:56:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:56:46,258 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-01-31 20:56:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:56:46,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-01-31 20:56:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:56:46,258 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:56:46,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-31 20:56:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:56:46,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:56:46,261 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:56:46,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:56:46,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:56:46,650 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 20:56:46,650 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:56:46,651 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2022-01-31 20:56:46,651 INFO L854 garLoopResultBuilder]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-01-31 20:56:46,652 INFO L861 garLoopResultBuilder]: At program point L36(lines 25 83) the Hoare annotation is: true [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4))) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L61(lines 61 79) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,652 INFO L854 garLoopResultBuilder]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,653 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L861 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,654 INFO L861 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2022-01-31 20:56:46,654 INFO L854 garLoopResultBuilder]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L861 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,655 INFO L854 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-01-31 20:56:46,655 INFO L861 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-01-31 20:56:46,656 INFO L854 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-01-31 20:56:46,656 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-01-31 20:56:46,656 INFO L854 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-01-31 20:56:46,656 INFO L861 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-01-31 20:56:46,656 INFO L861 garLoopResultBuilder]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2022-01-31 20:56:46,656 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,656 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 20:56:46,656 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,656 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,657 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,657 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,657 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:56:46,657 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:56:46,657 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 20:56:46,657 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:56:46,657 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:56:46,657 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:56:46,658 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:56:46,661 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-31 20:56:46,662 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:56:46,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:56:46 BoogieIcfgContainer [2022-01-31 20:56:46,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:56:46,687 INFO L158 Benchmark]: Toolchain (without parser) took 3271.60ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 120.2MB in the beginning and 119.6MB in the end (delta: 578.8kB). Peak memory consumption was 36.1MB. Max. memory is 8.0GB. [2022-01-31 20:56:46,689 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:56:46,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 168.8MB. Free memory was 120.0MB in the beginning and 145.3MB in the end (delta: -25.3MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-01-31 20:56:46,689 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 168.8MB. Free memory was 145.3MB in the beginning and 143.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 20:56:46,690 INFO L158 Benchmark]: RCFGBuilder took 266.08ms. Allocated memory is still 168.8MB. Free memory was 143.9MB in the beginning and 130.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 20:56:46,690 INFO L158 Benchmark]: TraceAbstraction took 2737.61ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 130.3MB in the beginning and 119.6MB in the end (delta: 10.7MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. [2022-01-31 20:56:46,692 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.10ms. Allocated memory is still 168.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 168.8MB. Free memory was 120.0MB in the beginning and 145.3MB in the end (delta: -25.3MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 168.8MB. Free memory was 145.3MB in the beginning and 143.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.08ms. Allocated memory is still 168.8MB. Free memory was 143.9MB in the beginning and 130.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2737.61ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 130.3MB in the beginning and 119.6MB in the end (delta: 10.7MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1309 IncrementalHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 318 mSolverCounterUnsat, 301 mSDtfsCounter, 1309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, 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, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 354 PreInvPairs, 452 NumberOfFragments, 779 HoareAnnotationTreeSize, 354 FomulaSimplifications, 38 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 54 FomulaSimplificationsInter, 397 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp - 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) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:56:46,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...