/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:43:48,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:43:48,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:43:48,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:43:48,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:43:48,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:43:48,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:43:48,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:43:48,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:43:48,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:43:48,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:43:48,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:43:48,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:43:48,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:43:48,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:43:48,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:43:48,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:43:48,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:43:48,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:43:48,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:43:48,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:43:48,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:43:48,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:43:48,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:43:48,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:43:48,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:43:48,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:43:48,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:43:48,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:43:48,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:43:48,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:43:48,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:43:48,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:43:48,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:43:48,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:43:48,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:43:48,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:43:48,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:43:48,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:43:48,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:43:48,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:43:48,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:43:48,238 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:43:48,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:43:48,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:43:48,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:43:48,242 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:43:48,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:43:48,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:43:48,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:43:48,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:43:48,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:43:48,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:43:48,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:43:48,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:43:48,246 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:43:48,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:43:48,247 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:43:48,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:43:48,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:43:48,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:43:48,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:43:48,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:43:48,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:43:48,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:43:48,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:43:48,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:43:48,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:43:48,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:43:48,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:43:48,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:43:48,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:43:48,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:43:48,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:43:48,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:43:48,766 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:43:48,766 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:43:48,767 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-09-04 13:43:48,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2e9046ec/243c5a2fd3104619a6a8b051a74748d7/FLAG13d7e4765 [2020-09-04 13:43:49,482 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:43:49,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-09-04 13:43:49,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2e9046ec/243c5a2fd3104619a6a8b051a74748d7/FLAG13d7e4765 [2020-09-04 13:43:49,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2e9046ec/243c5a2fd3104619a6a8b051a74748d7 [2020-09-04 13:43:49,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:43:49,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:43:49,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:49,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:43:49,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:43:49,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:49" (1/1) ... [2020-09-04 13:43:49,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265f99a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:49, skipping insertion in model container [2020-09-04 13:43:49,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:49" (1/1) ... [2020-09-04 13:43:49,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:43:49,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:43:50,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:50,129 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:43:50,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:50,275 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:43:50,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50 WrapperNode [2020-09-04 13:43:50,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:50,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:43:50,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:43:50,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:43:50,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... [2020-09-04 13:43:50,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:43:50,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:43:50,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:43:50,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:43:50,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:43:50,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:43:50,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:43:50,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:43:50,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:43:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:43:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:43:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:43:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 13:43:50,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:43:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:43:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:43:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:43:50,856 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:43:50,857 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:43:50,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:50 BoogieIcfgContainer [2020-09-04 13:43:50,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:43:50,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:43:50,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:43:50,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:43:50,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:43:49" (1/3) ... [2020-09-04 13:43:50,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e630e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:50, skipping insertion in model container [2020-09-04 13:43:50,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:50" (2/3) ... [2020-09-04 13:43:50,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e630e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:50, skipping insertion in model container [2020-09-04 13:43:50,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:50" (3/3) ... [2020-09-04 13:43:50,874 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-09-04 13:43:50,886 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:43:50,897 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-09-04 13:43:50,919 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-09-04 13:43:50,951 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:43:50,951 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:43:50,951 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:43:50,951 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:43:50,951 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:43:50,952 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:43:50,952 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:43:50,952 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:43:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-09-04 13:43:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-04 13:43:50,984 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:50,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:50,986 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1781845407, now seen corresponding path program 1 times [2020-09-04 13:43:51,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:51,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260686261] [2020-09-04 13:43:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:51,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:51,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260686261] [2020-09-04 13:43:51,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:51,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:43:51,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037414011] [2020-09-04 13:43:51,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:43:51,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:51,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:43:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:43:51,297 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2020-09-04 13:43:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:51,463 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2020-09-04 13:43:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:51,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-09-04 13:43:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:51,479 INFO L225 Difference]: With dead ends: 90 [2020-09-04 13:43:51,480 INFO L226 Difference]: Without dead ends: 76 [2020-09-04 13:43:51,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-04 13:43:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-09-04 13:43:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 13:43:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-09-04 13:43:51,535 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2020-09-04 13:43:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:51,536 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-09-04 13:43:51,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:43:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-09-04 13:43:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:43:51,537 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:51,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:51,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:43:51,538 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -594195383, now seen corresponding path program 1 times [2020-09-04 13:43:51,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:51,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811840143] [2020-09-04 13:43:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:51,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:51,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811840143] [2020-09-04 13:43:51,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:51,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:51,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573434854] [2020-09-04 13:43:51,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:51,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:51,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:51,624 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-09-04 13:43:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:51,883 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2020-09-04 13:43:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:51,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:43:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:51,886 INFO L225 Difference]: With dead ends: 153 [2020-09-04 13:43:51,886 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 13:43:51,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 13:43:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2020-09-04 13:43:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 13:43:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2020-09-04 13:43:51,902 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2020-09-04 13:43:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:51,903 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2020-09-04 13:43:51,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2020-09-04 13:43:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:43:51,904 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:51,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:51,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:43:51,905 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -597364152, now seen corresponding path program 1 times [2020-09-04 13:43:51,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:51,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048719281] [2020-09-04 13:43:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:51,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:52,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048719281] [2020-09-04 13:43:52,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:52,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:52,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724108391] [2020-09-04 13:43:52,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:52,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:52,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:52,015 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2020-09-04 13:43:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:52,123 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-09-04 13:43:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:52,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:43:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:52,125 INFO L225 Difference]: With dead ends: 75 [2020-09-04 13:43:52,125 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 13:43:52,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 13:43:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2020-09-04 13:43:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-09-04 13:43:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-09-04 13:43:52,136 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2020-09-04 13:43:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:52,136 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-09-04 13:43:52,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-09-04 13:43:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-04 13:43:52,137 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:52,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:52,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:43:52,138 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1240184593, now seen corresponding path program 1 times [2020-09-04 13:43:52,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:52,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733267687] [2020-09-04 13:43:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:52,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733267687] [2020-09-04 13:43:52,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:52,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:52,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621796155] [2020-09-04 13:43:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:52,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:52,236 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2020-09-04 13:43:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:52,443 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2020-09-04 13:43:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:52,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-09-04 13:43:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:52,446 INFO L225 Difference]: With dead ends: 96 [2020-09-04 13:43:52,446 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 13:43:52,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 13:43:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2020-09-04 13:43:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 13:43:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-09-04 13:43:52,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2020-09-04 13:43:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:52,456 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-09-04 13:43:52,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-09-04 13:43:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 13:43:52,457 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:52,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:52,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:43:52,458 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash 208986383, now seen corresponding path program 1 times [2020-09-04 13:43:52,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:52,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653279378] [2020-09-04 13:43:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:52,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653279378] [2020-09-04 13:43:52,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:52,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:52,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000089619] [2020-09-04 13:43:52,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:52,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:52,544 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-09-04 13:43:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:52,791 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-09-04 13:43:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:52,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-09-04 13:43:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:52,793 INFO L225 Difference]: With dead ends: 95 [2020-09-04 13:43:52,794 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 13:43:52,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:43:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 13:43:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2020-09-04 13:43:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 13:43:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-09-04 13:43:52,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2020-09-04 13:43:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:52,811 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-09-04 13:43:52,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-09-04 13:43:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 13:43:52,814 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:52,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:52,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:43:52,815 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1458792136, now seen corresponding path program 1 times [2020-09-04 13:43:52,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:52,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687414967] [2020-09-04 13:43:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:52,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687414967] [2020-09-04 13:43:52,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:52,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108927631] [2020-09-04 13:43:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:52,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:52,915 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2020-09-04 13:43:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,056 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-09-04 13:43:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:53,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 13:43:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,058 INFO L225 Difference]: With dead ends: 69 [2020-09-04 13:43:53,059 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 13:43:53,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 13:43:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2020-09-04 13:43:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 13:43:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-09-04 13:43:53,067 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2020-09-04 13:43:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,068 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-09-04 13:43:53,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-09-04 13:43:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 13:43:53,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:43:53,070 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2111353611, now seen corresponding path program 1 times [2020-09-04 13:43:53,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997244575] [2020-09-04 13:43:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997244575] [2020-09-04 13:43:53,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:53,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271602495] [2020-09-04 13:43:53,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:53,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:53,165 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2020-09-04 13:43:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,347 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2020-09-04 13:43:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:53,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 13:43:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,349 INFO L225 Difference]: With dead ends: 91 [2020-09-04 13:43:53,349 INFO L226 Difference]: Without dead ends: 89 [2020-09-04 13:43:53,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-04 13:43:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2020-09-04 13:43:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 13:43:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-09-04 13:43:53,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2020-09-04 13:43:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,364 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-09-04 13:43:53,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-09-04 13:43:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 13:43:53,365 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:43:53,365 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2022080917, now seen corresponding path program 1 times [2020-09-04 13:43:53,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897670985] [2020-09-04 13:43:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897670985] [2020-09-04 13:43:53,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:53,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532210530] [2020-09-04 13:43:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:53,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:53,480 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2020-09-04 13:43:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,683 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-09-04 13:43:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:53,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-09-04 13:43:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,685 INFO L225 Difference]: With dead ends: 73 [2020-09-04 13:43:53,686 INFO L226 Difference]: Without dead ends: 71 [2020-09-04 13:43:53,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-09-04 13:43:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-09-04 13:43:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 13:43:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-09-04 13:43:53,705 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2020-09-04 13:43:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,709 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-09-04 13:43:53,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-09-04 13:43:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 13:43:53,710 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:43:53,711 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1740004142, now seen corresponding path program 1 times [2020-09-04 13:43:53,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094187745] [2020-09-04 13:43:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094187745] [2020-09-04 13:43:53,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:53,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124316332] [2020-09-04 13:43:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:53,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:53,785 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2020-09-04 13:43:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,950 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-09-04 13:43:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:53,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-09-04 13:43:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,952 INFO L225 Difference]: With dead ends: 61 [2020-09-04 13:43:53,952 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 13:43:53,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:43:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 13:43:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2020-09-04 13:43:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 13:43:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-09-04 13:43:53,961 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2020-09-04 13:43:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,963 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-09-04 13:43:53,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-09-04 13:43:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:43:53,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:43:53,968 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1894443311, now seen corresponding path program 1 times [2020-09-04 13:43:53,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78644568] [2020-09-04 13:43:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78644568] [2020-09-04 13:43:54,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:54,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489716549] [2020-09-04 13:43:54,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:54,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:54,040 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-09-04 13:43:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,155 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-09-04 13:43:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:54,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-09-04 13:43:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,161 INFO L225 Difference]: With dead ends: 61 [2020-09-04 13:43:54,161 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 13:43:54,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 13:43:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-09-04 13:43:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 13:43:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-09-04 13:43:54,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2020-09-04 13:43:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,168 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-09-04 13:43:54,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-09-04 13:43:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:43:54,169 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:43:54,169 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1401802644, now seen corresponding path program 1 times [2020-09-04 13:43:54,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819917942] [2020-09-04 13:43:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819917942] [2020-09-04 13:43:54,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:54,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895271846] [2020-09-04 13:43:54,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:54,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:54,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:54,237 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-09-04 13:43:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,398 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-09-04 13:43:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:54,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-09-04 13:43:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,399 INFO L225 Difference]: With dead ends: 69 [2020-09-04 13:43:54,399 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 13:43:54,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 13:43:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2020-09-04 13:43:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 13:43:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-09-04 13:43:54,405 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2020-09-04 13:43:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,406 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-09-04 13:43:54,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-09-04 13:43:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:43:54,407 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:43:54,407 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash 506212151, now seen corresponding path program 1 times [2020-09-04 13:43:54,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304155701] [2020-09-04 13:43:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304155701] [2020-09-04 13:43:54,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:54,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581032549] [2020-09-04 13:43:54,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:54,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:54,464 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2020-09-04 13:43:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,631 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-09-04 13:43:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:54,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-09-04 13:43:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,632 INFO L225 Difference]: With dead ends: 74 [2020-09-04 13:43:54,633 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 13:43:54,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 13:43:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2020-09-04 13:43:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 13:43:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-09-04 13:43:54,639 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2020-09-04 13:43:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,639 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-09-04 13:43:54,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-09-04 13:43:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:43:54,640 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:43:54,641 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1487289350, now seen corresponding path program 1 times [2020-09-04 13:43:54,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771445734] [2020-09-04 13:43:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771445734] [2020-09-04 13:43:54,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:54,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158429220] [2020-09-04 13:43:54,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:54,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:54,708 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2020-09-04 13:43:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,945 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-09-04 13:43:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:43:54,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-09-04 13:43:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,946 INFO L225 Difference]: With dead ends: 62 [2020-09-04 13:43:54,946 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 13:43:54,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:43:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 13:43:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2020-09-04 13:43:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 13:43:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-09-04 13:43:54,952 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2020-09-04 13:43:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,952 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-09-04 13:43:54,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-09-04 13:43:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:43:54,953 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:43:54,954 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1138673565, now seen corresponding path program 1 times [2020-09-04 13:43:54,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084504934] [2020-09-04 13:43:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084504934] [2020-09-04 13:43:55,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:55,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678990356] [2020-09-04 13:43:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:55,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:55,015 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2020-09-04 13:43:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,249 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-09-04 13:43:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:55,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-09-04 13:43:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,252 INFO L225 Difference]: With dead ends: 87 [2020-09-04 13:43:55,252 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 13:43:55,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:43:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 13:43:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2020-09-04 13:43:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 13:43:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-09-04 13:43:55,261 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2020-09-04 13:43:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,262 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-09-04 13:43:55,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-09-04 13:43:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:43:55,266 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:43:55,267 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 939145312, now seen corresponding path program 1 times [2020-09-04 13:43:55,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976860618] [2020-09-04 13:43:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976860618] [2020-09-04 13:43:55,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:55,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477099770] [2020-09-04 13:43:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:55,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:55,374 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2020-09-04 13:43:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,597 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-09-04 13:43:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:43:55,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-04 13:43:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,598 INFO L225 Difference]: With dead ends: 60 [2020-09-04 13:43:55,598 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 13:43:55,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:43:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 13:43:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2020-09-04 13:43:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 13:43:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-09-04 13:43:55,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2020-09-04 13:43:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,605 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-09-04 13:43:55,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-09-04 13:43:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:43:55,610 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,610 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:43:55,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:43:55,612 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash -951263229, now seen corresponding path program 1 times [2020-09-04 13:43:55,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838305765] [2020-09-04 13:43:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838305765] [2020-09-04 13:43:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182561302] [2020-09-04 13:43:55,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:55,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:55,677 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-09-04 13:43:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:56,025 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2020-09-04 13:43:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:43:56,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-04 13:43:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:56,026 INFO L225 Difference]: With dead ends: 125 [2020-09-04 13:43:56,026 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:43:56,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:43:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:43:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:43:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:43:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:43:56,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-09-04 13:43:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:56,029 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:43:56,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:43:56,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:43:56,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:43:56,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:43:56,555 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-09-04 13:43:56,879 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2020-09-04 13:43:57,188 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-09-04 13:43:57,497 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 39 [2020-09-04 13:43:57,796 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 23 [2020-09-04 13:43:57,882 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:43:57,883 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_334~0 |old(~__return_334~0)|) (= ~__return_main~0 |old(~__return_main~0)|)) [2020-09-04 13:43:57,883 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:43:57,883 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:43:57,884 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:43:57,884 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:43:57,884 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:43:57,884 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:43:57,885 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-09-04 13:43:57,885 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:43:57,885 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:43:57,885 INFO L268 CegarLoopResult]: For program point L225(lines 225 267) no Hoare annotation was computed. [2020-09-04 13:43:57,886 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2020-09-04 13:43:57,886 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 311) no Hoare annotation was computed. [2020-09-04 13:43:57,886 INFO L268 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2020-09-04 13:43:57,886 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-09-04 13:43:57,887 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2020-09-04 13:43:57,887 INFO L268 CegarLoopResult]: For program point L201(lines 201 271) no Hoare annotation was computed. [2020-09-04 13:43:57,887 INFO L268 CegarLoopResult]: For program point L36(lines 36 292) no Hoare annotation was computed. [2020-09-04 13:43:57,887 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2020-09-04 13:43:57,887 INFO L268 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-09-04 13:43:57,888 INFO L268 CegarLoopResult]: For program point L243(line 243) no Hoare annotation was computed. [2020-09-04 13:43:57,888 INFO L268 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2020-09-04 13:43:57,888 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-09-04 13:43:57,888 INFO L268 CegarLoopResult]: For program point L227(line 227) no Hoare annotation was computed. [2020-09-04 13:43:57,889 INFO L268 CegarLoopResult]: For program point L161(lines 161 277) no Hoare annotation was computed. [2020-09-04 13:43:57,889 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2020-09-04 13:43:57,889 INFO L264 CegarLoopResult]: At program point L302(lines 23 310) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2020-09-04 13:43:57,889 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 311) no Hoare annotation was computed. [2020-09-04 13:43:57,889 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-09-04 13:43:57,890 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2020-09-04 13:43:57,890 INFO L268 CegarLoopResult]: For program point L137(lines 137 281) no Hoare annotation was computed. [2020-09-04 13:43:57,890 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2020-09-04 13:43:57,890 INFO L268 CegarLoopResult]: For program point L96(lines 96 123) no Hoare annotation was computed. [2020-09-04 13:43:57,890 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 311) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2020-09-04 13:43:57,891 INFO L268 CegarLoopResult]: For program point L253(lines 253 263) no Hoare annotation was computed. [2020-09-04 13:43:57,891 INFO L268 CegarLoopResult]: For program point L55(lines 55 284) no Hoare annotation was computed. [2020-09-04 13:43:57,891 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2020-09-04 13:43:57,891 INFO L268 CegarLoopResult]: For program point L72(lines 72 127) no Hoare annotation was computed. [2020-09-04 13:43:57,892 INFO L264 CegarLoopResult]: At program point L262(lines 29 304) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse4 (<= 0 main_~main__j~0)) (.cse5 (= |old(~__return_334~0)| ~__return_334~0))) (let ((.cse0 (<= 1 main_~main__j~0)) (.cse1 (let ((.cse6 (<= 1 main_~main__i~0))) (or (and .cse4 .cse6 .cse2 .cse5) (and .cse4 .cse6 .cse5 (not (= main_~__VERIFIER_assert__cond~12 0)))))) (.cse3 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3) (and (<= 0 main_~main__i~0) .cse4 (<= (+ main_~main__i~0 1) main_~main__len~0) .cse5 .cse3)))) [2020-09-04 13:43:57,892 INFO L268 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-09-04 13:43:57,892 INFO L268 CegarLoopResult]: For program point L64(lines 64 283) no Hoare annotation was computed. [2020-09-04 13:43:57,892 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2020-09-04 13:43:57,893 INFO L268 CegarLoopResult]: For program point L213(lines 213 269) no Hoare annotation was computed. [2020-09-04 13:43:57,893 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-09-04 13:43:57,893 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-09-04 13:43:57,893 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-09-04 13:43:57,893 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2020-09-04 13:43:57,894 INFO L268 CegarLoopResult]: For program point L255(line 255) no Hoare annotation was computed. [2020-09-04 13:43:57,894 INFO L268 CegarLoopResult]: For program point L189(lines 189 273) no Hoare annotation was computed. [2020-09-04 13:43:57,894 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-09-04 13:43:57,894 INFO L268 CegarLoopResult]: For program point L173(lines 173 275) no Hoare annotation was computed. [2020-09-04 13:43:57,894 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-09-04 13:43:57,895 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2020-09-04 13:43:57,895 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2020-09-04 13:43:57,895 INFO L268 CegarLoopResult]: For program point L215(line 215) no Hoare annotation was computed. [2020-09-04 13:43:57,895 INFO L268 CegarLoopResult]: For program point L149(lines 149 279) no Hoare annotation was computed. [2020-09-04 13:43:57,896 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-09-04 13:43:57,896 INFO L268 CegarLoopResult]: For program point L108(lines 108 121) no Hoare annotation was computed. [2020-09-04 13:43:57,896 INFO L268 CegarLoopResult]: For program point L34(lines 34 298) no Hoare annotation was computed. [2020-09-04 13:43:57,896 INFO L268 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-09-04 13:43:57,896 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2020-09-04 13:43:57,897 INFO L268 CegarLoopResult]: For program point L84(lines 84 125) no Hoare annotation was computed. [2020-09-04 13:43:57,897 INFO L268 CegarLoopResult]: For program point L18(lines 18 310) no Hoare annotation was computed. [2020-09-04 13:43:57,897 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 215) no Hoare annotation was computed. [2020-09-04 13:43:57,897 INFO L268 CegarLoopResult]: For program point L241(lines 241 265) no Hoare annotation was computed. [2020-09-04 13:43:57,897 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-09-04 13:43:57,898 INFO L268 CegarLoopResult]: For program point L43(lines 43 286) no Hoare annotation was computed. [2020-09-04 13:43:57,898 INFO L264 CegarLoopResult]: At program point L291(lines 36 292) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__i~0 1) main_~main__len~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2020-09-04 13:43:57,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:43:57 BoogieIcfgContainer [2020-09-04 13:43:57,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:43:57,935 INFO L168 Benchmark]: Toolchain (without parser) took 8127.71 ms. Allocated memory was 138.9 MB in the beginning and 289.4 MB in the end (delta: 150.5 MB). Free memory was 102.0 MB in the beginning and 102.7 MB in the end (delta: -674.8 kB). Peak memory consumption was 160.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:57,936 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:43:57,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.30 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 101.8 MB in the beginning and 179.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:57,938 INFO L168 Benchmark]: Boogie Preprocessor took 49.16 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 177.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:57,939 INFO L168 Benchmark]: RCFGBuilder took 537.40 ms. Allocated memory is still 200.3 MB. Free memory was 176.5 MB in the beginning and 154.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:57,940 INFO L168 Benchmark]: TraceAbstraction took 7067.93 ms. Allocated memory was 200.3 MB in the beginning and 289.4 MB in the end (delta: 89.1 MB). Free memory was 154.1 MB in the beginning and 102.7 MB in the end (delta: 51.4 MB). Peak memory consumption was 150.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:57,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 467.30 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 101.8 MB in the beginning and 179.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.16 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 177.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 537.40 ms. Allocated memory is still 200.3 MB. Free memory was 176.5 MB in the beginning and 154.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7067.93 ms. Allocated memory was 200.3 MB in the beginning and 289.4 MB in the end (delta: 89.1 MB). Free memory was 154.1 MB in the beginning and 102.7 MB in the end (delta: 51.4 MB). Peak memory consumption was 150.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 255]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 151]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 163]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 227]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 191]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 243]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 215]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 98]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 86]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 57]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((1 <= main__j && ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) || (((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)))) && main__j + 4 <= main__bufsize) && main__limit + 4 <= main__bufsize) || (((1 <= main__j && ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) || (((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)))) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize)) || ((((0 <= main__i && 0 <= main__j) && main__i + 1 <= main__len) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((0 <= main__i && 0 <= main__j) && main__j + 5 <= main__bufsize) && \old(__return_334) == __return_334) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (0 <= main__i && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 69 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 935 SDtfs, 1910 SDslu, 227 SDs, 0 SdLazy, 1420 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 157 HoareAnnotationTreeSize, 7 FomulaSimplifications, 909297226 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 567672 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 15056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...