/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -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.1-dev-1a84f73 [2021-05-01 07:08:10,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-01 07:08:10,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-01 07:08:10,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-01 07:08:10,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-01 07:08:10,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-01 07:08:10,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-01 07:08:10,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-01 07:08:10,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-01 07:08:10,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-01 07:08:10,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-01 07:08:10,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-01 07:08:10,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-01 07:08:10,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-01 07:08:10,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-01 07:08:10,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-01 07:08:10,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-01 07:08:10,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-01 07:08:10,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-01 07:08:10,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-01 07:08:10,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-01 07:08:10,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-01 07:08:10,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-01 07:08:10,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-01 07:08:10,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-01 07:08:10,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-01 07:08:10,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-01 07:08:10,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-01 07:08:10,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-01 07:08:10,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-01 07:08:10,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-01 07:08:10,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-01 07:08:10,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-01 07:08:10,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-01 07:08:10,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-01 07:08:10,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-01 07:08:10,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-01 07:08:10,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-01 07:08:10,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-01 07:08:10,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-01 07:08:10,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-01 07:08:10,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-01 07:08:10,885 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-01 07:08:10,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-01 07:08:10,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-01 07:08:10,887 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-01 07:08:10,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-01 07:08:10,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-01 07:08:10,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-01 07:08:10,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-01 07:08:10,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-01 07:08:10,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-01 07:08:10,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-01 07:08:10,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-01 07:08:10,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-01 07:08:10,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 07:08:10,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-01 07:08:10,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-01 07:08:10,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-01 07:08:10,890 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-01 07:08:10,890 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 [2021-05-01 07:08:11,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-01 07:08:11,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-01 07:08:11,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-01 07:08:11,209 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-01 07:08:11,210 INFO L275 PluginConnector]: CDTParser initialized [2021-05-01 07:08:11,211 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 [2021-05-01 07:08:11,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a876ac70a/748e323ac563416f964cf600552f23bb/FLAG1e660b09a [2021-05-01 07:08:11,691 INFO L306 CDTParser]: Found 1 translation units. [2021-05-01 07:08:11,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2021-05-01 07:08:11,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a876ac70a/748e323ac563416f964cf600552f23bb/FLAG1e660b09a [2021-05-01 07:08:12,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a876ac70a/748e323ac563416f964cf600552f23bb [2021-05-01 07:08:12,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-01 07:08:12,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-01 07:08:12,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:12,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-01 07:08:12,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-01 07:08:12,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee5493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12, skipping insertion in model container [2021-05-01 07:08:12,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-01 07:08:12,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-01 07:08:12,257 WARN L224 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] [2021-05-01 07:08:12,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:12,284 INFO L203 MainTranslator]: Completed pre-run [2021-05-01 07:08:12,295 WARN L224 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] [2021-05-01 07:08:12,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:12,318 INFO L208 MainTranslator]: Completed translation [2021-05-01 07:08:12,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12 WrapperNode [2021-05-01 07:08:12,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:12,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-01 07:08:12,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-01 07:08:12,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-01 07:08:12,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... [2021-05-01 07:08:12,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-01 07:08:12,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-01 07:08:12,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-01 07:08:12,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-01 07:08:12,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 07:08:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-01 07:08:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-01 07:08:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-01 07:08:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-01 07:08:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-01 07:08:12,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-01 07:08:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-01 07:08:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-01 07:08:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-01 07:08:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-01 07:08:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-01 07:08:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-01 07:08:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-01 07:08:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-01 07:08:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-01 07:08:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-01 07:08:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-01 07:08:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-01 07:08:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-01 07:08:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-01 07:08:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-01 07:08:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-01 07:08:12,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-01 07:08:12,837 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-01 07:08:12,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:12 BoogieIcfgContainer [2021-05-01 07:08:12,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-01 07:08:12,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-01 07:08:12,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-01 07:08:12,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-01 07:08:12,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.05 07:08:12" (1/3) ... [2021-05-01 07:08:12,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c439683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:12, skipping insertion in model container [2021-05-01 07:08:12,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:12" (2/3) ... [2021-05-01 07:08:12,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c439683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:12, skipping insertion in model container [2021-05-01 07:08:12,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:12" (3/3) ... [2021-05-01 07:08:12,867 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2021-05-01 07:08:12,871 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-01 07:08:12,875 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-01 07:08:12,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-01 07:08:12,902 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-01 07:08:12,902 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-01 07:08:12,902 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-01 07:08:12,902 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-01 07:08:12,902 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-01 07:08:12,903 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-01 07:08:12,903 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-01 07:08:12,903 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-01 07:08:12,916 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) [2021-05-01 07:08:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-01 07:08:12,923 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:12,923 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:12,924 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2021-05-01 07:08:12,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:12,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483695365] [2021-05-01 07:08:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:12,988 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:13,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:13,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:13,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:13,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:13,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:13,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:13,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 07:08:13,166 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:13,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483695365] [2021-05-01 07:08:13,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1483695365] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:13,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:13,170 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:13,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212485498] [2021-05-01 07:08:13,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:13,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:13,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:13,191 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) [2021-05-01 07:08:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:13,839 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2021-05-01 07:08:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:13,841 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 [2021-05-01 07:08:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:13,850 INFO L225 Difference]: With dead ends: 112 [2021-05-01 07:08:13,851 INFO L226 Difference]: Without dead ends: 64 [2021-05-01 07:08:13,856 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 175.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-01 07:08:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2021-05-01 07:08:13,898 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) [2021-05-01 07:08:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-05-01 07:08:13,901 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2021-05-01 07:08:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:13,901 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-05-01 07:08:13,901 INFO L481 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) [2021-05-01 07:08:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-05-01 07:08:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-01 07:08:13,903 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:13,903 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:13,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-01 07:08:13,904 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2021-05-01 07:08:13,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:13,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115973651] [2021-05-01 07:08:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:13,908 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:13,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:13,951 INFO L142 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-05-01 07:08:13,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:13,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:13,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:13,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:13,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:13,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:13,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-01 07:08:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 07:08:14,038 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:14,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115973651] [2021-05-01 07:08:14,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1115973651] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:14,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:14,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:14,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525020286] [2021-05-01 07:08:14,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:14,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:14,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:14,041 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) [2021-05-01 07:08:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:14,395 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2021-05-01 07:08:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:14,402 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 [2021-05-01 07:08:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:14,406 INFO L225 Difference]: With dead ends: 63 [2021-05-01 07:08:14,406 INFO L226 Difference]: Without dead ends: 61 [2021-05-01 07:08:14,408 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 129.4ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-01 07:08:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-01 07:08:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-01 07:08:14,422 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) [2021-05-01 07:08:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2021-05-01 07:08:14,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2021-05-01 07:08:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:14,424 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2021-05-01 07:08:14,425 INFO L481 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) [2021-05-01 07:08:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2021-05-01 07:08:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-01 07:08:14,426 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:14,426 INFO L519 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] [2021-05-01 07:08:14,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-01 07:08:14,427 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2021-05-01 07:08:14,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:14,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573292115] [2021-05-01 07:08:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:14,434 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-01 07:08:14,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-01 07:08:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-01 07:08:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-01 07:08:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-01 07:08:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-05-01 07:08:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-01 07:08:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-01 07:08:14,541 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:14,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573292115] [2021-05-01 07:08:14,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1573292115] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:14,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:14,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-01 07:08:14,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375316310] [2021-05-01 07:08:14,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-01 07:08:14,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-01 07:08:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-01 07:08:14,544 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) [2021-05-01 07:08:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:14,754 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2021-05-01 07:08:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-01 07:08:14,754 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 [2021-05-01 07:08:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:14,758 INFO L225 Difference]: With dead ends: 90 [2021-05-01 07:08:14,758 INFO L226 Difference]: Without dead ends: 61 [2021-05-01 07:08:14,761 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-01 07:08:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-01 07:08:14,781 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) [2021-05-01 07:08:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2021-05-01 07:08:14,787 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2021-05-01 07:08:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:14,787 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2021-05-01 07:08:14,787 INFO L481 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) [2021-05-01 07:08:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2021-05-01 07:08:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-01 07:08:14,791 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:14,791 INFO L519 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] [2021-05-01 07:08:14,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-01 07:08:14,791 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2021-05-01 07:08:14,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:14,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096367512] [2021-05-01 07:08:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:14,799 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,874 INFO L142 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-05-01 07:08:14,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:14,879 INFO L142 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size [2021-05-01 07:08:14,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-01 07:08:14,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:14,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:14,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-01 07:08:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-01 07:08:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-01 07:08:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-01 07:08:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-01 07:08:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-01 07:08:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:14,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:14,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-01 07:08:14,982 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:14,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096367512] [2021-05-01 07:08:14,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2096367512] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:14,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:14,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:14,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228883469] [2021-05-01 07:08:14,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:14,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:14,984 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) [2021-05-01 07:08:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:15,324 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2021-05-01 07:08:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:15,325 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 [2021-05-01 07:08:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:15,326 INFO L225 Difference]: With dead ends: 68 [2021-05-01 07:08:15,326 INFO L226 Difference]: Without dead ends: 66 [2021-05-01 07:08:15,327 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 125.3ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-01 07:08:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-01 07:08:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-05-01 07:08:15,339 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) [2021-05-01 07:08:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2021-05-01 07:08:15,340 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2021-05-01 07:08:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:15,341 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2021-05-01 07:08:15,341 INFO L481 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) [2021-05-01 07:08:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2021-05-01 07:08:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-01 07:08:15,343 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:15,343 INFO L519 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] [2021-05-01 07:08:15,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-01 07:08:15,343 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2021-05-01 07:08:15,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:15,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014347845] [2021-05-01 07:08:15,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:15,346 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:15,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:15,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:15,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:15,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-01 07:08:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-01 07:08:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-01 07:08:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-01 07:08:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-01 07:08:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-01 07:08:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-01 07:08:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-01 07:08:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-01 07:08:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-01 07:08:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-01 07:08:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-01 07:08:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-01 07:08:15,518 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:15,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014347845] [2021-05-01 07:08:15,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014347845] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:15,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:15,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:15,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366981827] [2021-05-01 07:08:15,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:15,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:15,523 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) [2021-05-01 07:08:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:15,844 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2021-05-01 07:08:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:15,846 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 [2021-05-01 07:08:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:15,848 INFO L225 Difference]: With dead ends: 74 [2021-05-01 07:08:15,848 INFO L226 Difference]: Without dead ends: 72 [2021-05-01 07:08:15,849 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 119.4ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-01 07:08:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-01 07:08:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-05-01 07:08:15,863 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) [2021-05-01 07:08:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2021-05-01 07:08:15,864 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2021-05-01 07:08:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:15,865 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2021-05-01 07:08:15,865 INFO L481 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) [2021-05-01 07:08:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2021-05-01 07:08:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-01 07:08:15,866 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:15,866 INFO L519 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] [2021-05-01 07:08:15,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-01 07:08:15,867 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2021-05-01 07:08:15,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:15,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901335126] [2021-05-01 07:08:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:15,869 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:15,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:15,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:15,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:15,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-01 07:08:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-01 07:08:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-01 07:08:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-01 07:08:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-01 07:08:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-01 07:08:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-01 07:08:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-01 07:08:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-01 07:08:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-05-01 07:08:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-01 07:08:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-05-01 07:08:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:15,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:15,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:15,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-05-01 07:08:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:16,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:16,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-01 07:08:16,001 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:16,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901335126] [2021-05-01 07:08:16,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1901335126] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:16,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:16,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:16,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469179549] [2021-05-01 07:08:16,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:16,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:16,002 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) [2021-05-01 07:08:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:16,308 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2021-05-01 07:08:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:16,309 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 [2021-05-01 07:08:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:16,312 INFO L225 Difference]: With dead ends: 75 [2021-05-01 07:08:16,312 INFO L226 Difference]: Without dead ends: 0 [2021-05-01 07:08:16,315 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 103.4ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-01 07:08:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-01 07:08:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-01 07:08:16,315 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) [2021-05-01 07:08:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-01 07:08:16,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2021-05-01 07:08:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:16,316 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-01 07:08:16,316 INFO L481 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) [2021-05-01 07:08:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-01 07:08:16,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-01 07:08:16,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-01 07:08:16,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-01 07:08:17,337 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2021-05-01 07:08:17,786 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-01 07:08:17,787 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-01 07:08:17,787 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:17,787 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-01 07:08:17,787 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-01 07:08:17,787 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-01 07:08:17,788 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-01 07:08:17,788 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-01 07:08:17,788 INFO L201 CegarLoopUtils]: At program point L36(lines 25 83) the Hoare annotation is: true [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L69-1(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L61(lines 61 79) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,788 INFO L194 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L71(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L71-1(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L63-1(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,789 INFO L194 CegarLoopUtils]: At program point L72(line 72) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L201 CegarLoopUtils]: At program point L81(lines 25 83) the Hoare annotation is: true [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L201 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: true [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2) (and (= main_~c~0 0) .cse0 .cse1 .cse2))) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L194 CegarLoopUtils]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,790 INFO L201 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-01 07:08:17,791 INFO L201 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: true [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2021-05-01 07:08:17,791 INFO L194 CegarLoopUtils]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-05-01 07:08:17,791 INFO L201 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: true [2021-05-01 07:08:17,791 INFO L201 CegarLoopUtils]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2021-05-01 07:08:17,792 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-01 07:08:17,792 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-01 07:08:17,792 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-01 07:08:17,792 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-01 07:08:17,792 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-01 07:08:17,792 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-01 07:08:17,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 07:08:17 BoogieIcfgContainer [2021-05-01 07:08:17,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-01 07:08:17,807 INFO L168 Benchmark]: Toolchain (without parser) took 5695.85 ms. Allocated memory was 197.1 MB in the beginning and 298.8 MB in the end (delta: 101.7 MB). Free memory was 163.3 MB in the beginning and 166.6 MB in the end (delta: -3.3 MB). Peak memory consumption was 129.1 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:17,808 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 197.1 MB. Free memory is still 179.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-01 07:08:17,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.62 ms. Allocated memory is still 197.1 MB. Free memory was 163.1 MB in the beginning and 152.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:17,808 INFO L168 Benchmark]: Boogie Preprocessor took 31.03 ms. Allocated memory is still 197.1 MB. Free memory was 152.7 MB in the beginning and 151.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:17,808 INFO L168 Benchmark]: RCFGBuilder took 487.26 ms. Allocated memory is still 197.1 MB. Free memory was 151.0 MB in the beginning and 161.8 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:17,809 INFO L168 Benchmark]: TraceAbstraction took 4945.77 ms. Allocated memory was 197.1 MB in the beginning and 298.8 MB in the end (delta: 101.7 MB). Free memory was 161.4 MB in the beginning and 166.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 127.7 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:17,810 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.12 ms. Allocated memory is still 197.1 MB. Free memory is still 179.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 206.62 ms. Allocated memory is still 197.1 MB. Free memory was 163.1 MB in the beginning and 152.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.03 ms. Allocated memory is still 197.1 MB. Free memory was 152.7 MB in the beginning and 151.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 487.26 ms. Allocated memory is still 197.1 MB. Free memory was 151.0 MB in the beginning and 161.8 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4945.77 ms. Allocated memory was 197.1 MB in the beginning and 298.8 MB in the end (delta: 101.7 MB). Free memory was 161.4 MB in the beginning and 166.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 127.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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. VerificationResult: SAFE, OverallTime: 3417.1ms, OverallIterations: 6, TraceHistogramMax: 14, EmptinessCheckTime: 18.8ms, AutomataDifference: 2249.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1469.0ms, InitialAbstractionConstructionTime: 9.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 294 SDtfs, 275 SDslu, 356 SDs, 0 SdLazy, 1069 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1087.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 692.2ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 102.4ms AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 54 LocationsWithAnnotation, 354 PreInvPairs, 452 NumberOfFragments, 783 HoareAnnotationTreeSize, 354 FomulaSimplifications, 1484 FormulaSimplificationTreeSizeReduction, 328.4ms HoareSimplificationTime, 54 FomulaSimplificationsInter, 1486 FormulaSimplificationTreeSizeReductionInter, 1097.5ms 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: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && 1 <= cp) && cp < urilen - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((1 <= c && 0 < scheme + 1) && 1 <= cp) && cp < urilen) || (((c == 0 && 0 < scheme + 1) && 1 <= cp) && cp < urilen) - 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! Received shutdown request...