./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6d41d2a2a28e240d9196f063199b00c22e981e9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:59:55,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:59:55,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:59:55,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:59:55,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:59:55,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:59:55,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:59:55,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:59:55,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:59:55,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:59:55,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:59:55,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:59:55,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:59:55,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:59:55,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:59:55,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:59:55,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:59:55,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:59:55,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:59:55,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:59:55,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:59:55,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:59:55,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:59:55,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:59:55,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:59:55,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:59:55,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:59:55,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:59:55,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:59:55,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:59:55,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:59:55,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:59:55,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:59:55,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:59:55,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:59:55,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:59:55,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:59:55,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:59:55,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:59:55,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:59:55,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:59:55,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:59:55,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:59:55,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:59:55,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:59:55,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:59:55,487 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:59:55,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:59:55,488 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:59:55,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:59:55,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:59:55,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:59:55,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:59:55,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:59:55,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:59:55,490 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:59:55,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:59:55,490 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:59:55,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:59:55,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:59:55,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:59:55,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:59:55,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:59:55,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:59:55,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:59:55,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:59:55,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:59:55,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:59:55,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:59:55,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:59:55,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:59:55,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6d41d2a2a28e240d9196f063199b00c22e981e9 [2020-10-20 00:59:55,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:59:55,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:59:55,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:59:55,719 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:59:55,720 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:59:55,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-10-20 00:59:55,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350596994/4faf9083f47c4469b864038bd55baed1/FLAG865ddd41e [2020-10-20 00:59:56,379 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:59:56,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-10-20 00:59:56,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350596994/4faf9083f47c4469b864038bd55baed1/FLAG865ddd41e [2020-10-20 00:59:56,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350596994/4faf9083f47c4469b864038bd55baed1 [2020-10-20 00:59:56,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:59:56,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:59:56,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:59:56,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:59:56,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:59:56,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:59:56" (1/1) ... [2020-10-20 00:59:56,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a22bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:56, skipping insertion in model container [2020-10-20 00:59:56,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:59:56" (1/1) ... [2020-10-20 00:59:56,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:59:56,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:59:56,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:59:56,984 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:59:57,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:59:57,041 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:59:57,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57 WrapperNode [2020-10-20 00:59:57,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:59:57,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:59:57,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:59:57,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:59:57,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:59:57,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:59:57,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:59:57,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:59:57,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:59:57,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:59:57,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:59:57,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:59:57,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:59:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:59:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:59:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:59:57,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:59:57,648 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:59:57,648 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-20 00:59:57,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:57 BoogieIcfgContainer [2020-10-20 00:59:57,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:59:57,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:59:57,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:59:57,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:59:57,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:59:56" (1/3) ... [2020-10-20 00:59:57,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa64ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:59:57, skipping insertion in model container [2020-10-20 00:59:57,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (2/3) ... [2020-10-20 00:59:57,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa64ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:59:57, skipping insertion in model container [2020-10-20 00:59:57,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:57" (3/3) ... [2020-10-20 00:59:57,658 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-10-20 00:59:57,670 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:59:57,678 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-10-20 00:59:57,690 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-10-20 00:59:57,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:59:57,712 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:59:57,712 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:59:57,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:59:57,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:59:57,713 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:59:57,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:59:57,714 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:59:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-10-20 00:59:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 00:59:57,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:57,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:57,740 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2020-10-20 00:59:57,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:57,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499997013] [2020-10-20 00:59:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:57,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499997013] [2020-10-20 00:59:57,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:57,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:59:57,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517654242] [2020-10-20 00:59:57,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:59:57,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:59:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:59:57,974 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-10-20 00:59:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:58,021 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2020-10-20 00:59:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:59:58,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 00:59:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:58,033 INFO L225 Difference]: With dead ends: 99 [2020-10-20 00:59:58,033 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 00:59:58,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:59:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 00:59:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2020-10-20 00:59:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 00:59:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-10-20 00:59:58,075 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2020-10-20 00:59:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:58,076 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-10-20 00:59:58,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:59:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-10-20 00:59:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:59:58,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:59:58,078 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,079 INFO L82 PathProgramCache]: Analyzing trace with hash -182800492, now seen corresponding path program 1 times [2020-10-20 00:59:58,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172360848] [2020-10-20 00:59:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172360848] [2020-10-20 00:59:58,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:58,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906188458] [2020-10-20 00:59:58,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:58,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:58,183 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2020-10-20 00:59:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:58,273 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-10-20 00:59:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:59:58,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 00:59:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:58,275 INFO L225 Difference]: With dead ends: 73 [2020-10-20 00:59:58,275 INFO L226 Difference]: Without dead ends: 71 [2020-10-20 00:59:58,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-20 00:59:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2020-10-20 00:59:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 00:59:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-10-20 00:59:58,286 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2020-10-20 00:59:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:58,286 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-10-20 00:59:58,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-10-20 00:59:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:59:58,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:59:58,288 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash -178198776, now seen corresponding path program 1 times [2020-10-20 00:59:58,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201926433] [2020-10-20 00:59:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201926433] [2020-10-20 00:59:58,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:58,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263024345] [2020-10-20 00:59:58,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:58,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:58,370 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2020-10-20 00:59:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:58,460 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2020-10-20 00:59:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:58,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 00:59:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:58,463 INFO L225 Difference]: With dead ends: 143 [2020-10-20 00:59:58,463 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 00:59:58,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 00:59:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2020-10-20 00:59:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 00:59:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-10-20 00:59:58,474 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2020-10-20 00:59:58,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:58,474 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-10-20 00:59:58,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-10-20 00:59:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:59:58,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:59:58,476 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1229188689, now seen corresponding path program 1 times [2020-10-20 00:59:58,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844162027] [2020-10-20 00:59:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844162027] [2020-10-20 00:59:58,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:58,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261620516] [2020-10-20 00:59:58,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:58,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:58,599 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2020-10-20 00:59:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:58,701 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2020-10-20 00:59:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:59:58,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 00:59:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:58,703 INFO L225 Difference]: With dead ends: 92 [2020-10-20 00:59:58,703 INFO L226 Difference]: Without dead ends: 90 [2020-10-20 00:59:58,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-20 00:59:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2020-10-20 00:59:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-20 00:59:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-10-20 00:59:58,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2020-10-20 00:59:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:58,712 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-10-20 00:59:58,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-10-20 00:59:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 00:59:58,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:59:58,713 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash 422614912, now seen corresponding path program 1 times [2020-10-20 00:59:58,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967878563] [2020-10-20 00:59:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967878563] [2020-10-20 00:59:58,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:58,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24895150] [2020-10-20 00:59:58,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:58,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:58,807 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2020-10-20 00:59:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:58,881 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-10-20 00:59:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:58,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 00:59:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:58,883 INFO L225 Difference]: With dead ends: 69 [2020-10-20 00:59:58,883 INFO L226 Difference]: Without dead ends: 67 [2020-10-20 00:59:58,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-20 00:59:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2020-10-20 00:59:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 00:59:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-10-20 00:59:58,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2020-10-20 00:59:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:58,891 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-10-20 00:59:58,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-10-20 00:59:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 00:59:58,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:59:58,892 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash 549862385, now seen corresponding path program 1 times [2020-10-20 00:59:58,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409180224] [2020-10-20 00:59:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409180224] [2020-10-20 00:59:58,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:58,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686631785] [2020-10-20 00:59:58,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:58,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:58,943 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2020-10-20 00:59:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,049 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-10-20 00:59:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:59:59,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 00:59:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,051 INFO L225 Difference]: With dead ends: 87 [2020-10-20 00:59:59,051 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 00:59:59,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-20 00:59:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 00:59:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2020-10-20 00:59:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-20 00:59:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-10-20 00:59:59,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2020-10-20 00:59:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,059 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-10-20 00:59:59,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:59:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-10-20 00:59:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 00:59:59,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:59:59,060 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 216166494, now seen corresponding path program 1 times [2020-10-20 00:59:59,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679323723] [2020-10-20 00:59:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679323723] [2020-10-20 00:59:59,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:59,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799815170] [2020-10-20 00:59:59,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:59,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:59,113 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2020-10-20 00:59:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,249 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2020-10-20 00:59:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:59,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 00:59:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,251 INFO L225 Difference]: With dead ends: 75 [2020-10-20 00:59:59,251 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 00:59:59,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10-20 00:59:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 00:59:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2020-10-20 00:59:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 00:59:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-10-20 00:59:59,257 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2020-10-20 00:59:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,258 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-10-20 00:59:59,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:59:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-10-20 00:59:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 00:59:59,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 00:59:59,259 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash -134129160, now seen corresponding path program 1 times [2020-10-20 00:59:59,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901614602] [2020-10-20 00:59:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901614602] [2020-10-20 00:59:59,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:59,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045208311] [2020-10-20 00:59:59,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:59,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:59,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:59,303 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2020-10-20 00:59:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,377 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2020-10-20 00:59:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:59:59,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 00:59:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,379 INFO L225 Difference]: With dead ends: 83 [2020-10-20 00:59:59,379 INFO L226 Difference]: Without dead ends: 81 [2020-10-20 00:59:59,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-20 00:59:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2020-10-20 00:59:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 00:59:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-10-20 00:59:59,386 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2020-10-20 00:59:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,386 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-10-20 00:59:59,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-10-20 00:59:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:59:59,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 00:59:59,388 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1888767159, now seen corresponding path program 1 times [2020-10-20 00:59:59,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624807499] [2020-10-20 00:59:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624807499] [2020-10-20 00:59:59,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:59,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759181606] [2020-10-20 00:59:59,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:59,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:59,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:59,437 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-10-20 00:59:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,520 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2020-10-20 00:59:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:59:59,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 00:59:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,521 INFO L225 Difference]: With dead ends: 57 [2020-10-20 00:59:59,522 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 00:59:59,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-20 00:59:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 00:59:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-10-20 00:59:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 00:59:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-10-20 00:59:59,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2020-10-20 00:59:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,529 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-10-20 00:59:59,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:59:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-10-20 00:59:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 00:59:59,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 00:59:59,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1577766343, now seen corresponding path program 1 times [2020-10-20 00:59:59,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775523199] [2020-10-20 00:59:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775523199] [2020-10-20 00:59:59,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:59,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859660774] [2020-10-20 00:59:59,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:59,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:59,592 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2020-10-20 00:59:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,644 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2020-10-20 00:59:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:59:59,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 00:59:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,646 INFO L225 Difference]: With dead ends: 57 [2020-10-20 00:59:59,646 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 00:59:59,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 00:59:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2020-10-20 00:59:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 00:59:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-10-20 00:59:59,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2020-10-20 00:59:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,653 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-10-20 00:59:59,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-10-20 00:59:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:59:59,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 00:59:59,655 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1666122514, now seen corresponding path program 1 times [2020-10-20 00:59:59,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107976228] [2020-10-20 00:59:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107976228] [2020-10-20 00:59:59,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:59,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066662542] [2020-10-20 00:59:59,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:59,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:59,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:59,695 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 4 states. [2020-10-20 00:59:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,777 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2020-10-20 00:59:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:59,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 00:59:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,779 INFO L225 Difference]: With dead ends: 65 [2020-10-20 00:59:59,779 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 00:59:59,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-20 00:59:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 00:59:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2020-10-20 00:59:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 00:59:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-10-20 00:59:59,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2020-10-20 00:59:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,786 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-10-20 00:59:59,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-10-20 00:59:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:59:59,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 00:59:59,788 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash 110196528, now seen corresponding path program 1 times [2020-10-20 00:59:59,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247430829] [2020-10-20 00:59:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247430829] [2020-10-20 00:59:59,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:59,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811087908] [2020-10-20 00:59:59,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:59,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:59,851 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2020-10-20 00:59:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,970 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2020-10-20 00:59:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:59,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-20 00:59:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,971 INFO L225 Difference]: With dead ends: 70 [2020-10-20 00:59:59,972 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 00:59:59,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:59:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 00:59:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2020-10-20 00:59:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 00:59:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-10-20 00:59:59,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2020-10-20 00:59:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,978 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-10-20 00:59:59,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:59:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-10-20 00:59:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:59:59,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 00:59:59,980 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:59:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash -878868773, now seen corresponding path program 1 times [2020-10-20 00:59:59,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675351553] [2020-10-20 00:59:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675351553] [2020-10-20 01:00:00,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:00,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073401654] [2020-10-20 01:00:00,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:00,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:00,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:00,029 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2020-10-20 01:00:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,171 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2020-10-20 01:00:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:00:00,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 01:00:00,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,173 INFO L225 Difference]: With dead ends: 58 [2020-10-20 01:00:00,173 INFO L226 Difference]: Without dead ends: 56 [2020-10-20 01:00:00,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:00:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-20 01:00:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2020-10-20 01:00:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 01:00:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-10-20 01:00:00,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2020-10-20 01:00:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,180 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-10-20 01:00:00,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-10-20 01:00:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 01:00:00,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,181 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-10-20 01:00:00,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:00:00,182 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1475122023, now seen corresponding path program 1 times [2020-10-20 01:00:00,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348237294] [2020-10-20 01:00:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348237294] [2020-10-20 01:00:00,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:00,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668391979] [2020-10-20 01:00:00,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:00,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:00,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:00,222 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2020-10-20 01:00:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,348 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2020-10-20 01:00:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:00,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-20 01:00:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,350 INFO L225 Difference]: With dead ends: 83 [2020-10-20 01:00:00,350 INFO L226 Difference]: Without dead ends: 81 [2020-10-20 01:00:00,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-20 01:00:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2020-10-20 01:00:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 01:00:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-10-20 01:00:00,366 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-10-20 01:00:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,367 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-10-20 01:00:00,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-10-20 01:00:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 01:00:00,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,368 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-10-20 01:00:00,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:00:00,368 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1515863716, now seen corresponding path program 1 times [2020-10-20 01:00:00,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307151120] [2020-10-20 01:00:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307151120] [2020-10-20 01:00:00,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:00,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504188754] [2020-10-20 01:00:00,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:00,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:00,445 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-10-20 01:00:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,624 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-10-20 01:00:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:00:00,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 01:00:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,626 INFO L225 Difference]: With dead ends: 56 [2020-10-20 01:00:00,626 INFO L226 Difference]: Without dead ends: 54 [2020-10-20 01:00:00,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:00:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-20 01:00:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2020-10-20 01:00:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 01:00:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-10-20 01:00:00,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-10-20 01:00:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,632 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-10-20 01:00:00,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-10-20 01:00:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 01:00:00,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,633 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-10-20 01:00:00,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:00:00,633 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:00:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash -252858878, now seen corresponding path program 1 times [2020-10-20 01:00:00,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592070187] [2020-10-20 01:00:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592070187] [2020-10-20 01:00:00,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:00,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97971270] [2020-10-20 01:00:00,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:00,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:00,694 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-10-20 01:00:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,890 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2020-10-20 01:00:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:00:00,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-20 01:00:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,902 INFO L225 Difference]: With dead ends: 121 [2020-10-20 01:00:00,902 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:00:00,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:00:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:00:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:00:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:00:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:00:00,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-10-20 01:00:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,904 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:00:00,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:00:00,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:00:00,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:00:00,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:00:01,025 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2020-10-20 01:00:01,184 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 98 [2020-10-20 01:00:01,346 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2020-10-20 01:00:01,502 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 17 [2020-10-20 01:00:01,925 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2020-10-20 01:00:02,165 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 9 [2020-10-20 01:00:02,168 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,168 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,168 INFO L274 CegarLoopResult]: For program point L151(lines 151 281) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point L110(lines 110 123) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point L36(lines 36 300) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point L86(lines 86 127) no Hoare annotation was computed. [2020-10-20 01:00:02,169 INFO L274 CegarLoopResult]: For program point L20(lines 20 312) no Hoare annotation was computed. [2020-10-20 01:00:02,170 INFO L274 CegarLoopResult]: For program point L243(lines 243 267) no Hoare annotation was computed. [2020-10-20 01:00:02,170 INFO L274 CegarLoopResult]: For program point L45(lines 45 288) no Hoare annotation was computed. [2020-10-20 01:00:02,170 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,171 INFO L270 CegarLoopResult]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2020-10-20 01:00:02,171 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,171 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,172 INFO L274 CegarLoopResult]: For program point L227(lines 227 269) no Hoare annotation was computed. [2020-10-20 01:00:02,172 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,172 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,172 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,172 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,173 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,174 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,174 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,174 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,174 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,174 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,175 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,175 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,175 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,175 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,175 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,176 INFO L277 CegarLoopResult]: At program point L310(lines 13 313) the Hoare annotation is: true [2020-10-20 01:00:02,176 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,176 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,176 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,177 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point L203(lines 203 273) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,178 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,179 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,179 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,179 INFO L274 CegarLoopResult]: For program point L38(lines 38 294) no Hoare annotation was computed. [2020-10-20 01:00:02,179 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,179 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,180 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,180 INFO L274 CegarLoopResult]: For program point L163(lines 163 279) no Hoare annotation was computed. [2020-10-20 01:00:02,180 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,181 INFO L270 CegarLoopResult]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2020-10-20 01:00:02,182 INFO L274 CegarLoopResult]: For program point L139(lines 139 283) no Hoare annotation was computed. [2020-10-20 01:00:02,182 INFO L274 CegarLoopResult]: For program point L98(lines 98 125) no Hoare annotation was computed. [2020-10-20 01:00:02,182 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:00:02,182 INFO L274 CegarLoopResult]: For program point L255(lines 255 265) no Hoare annotation was computed. [2020-10-20 01:00:02,182 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,183 INFO L274 CegarLoopResult]: For program point L57(lines 57 286) no Hoare annotation was computed. [2020-10-20 01:00:02,183 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,184 INFO L274 CegarLoopResult]: For program point L74(lines 74 129) no Hoare annotation was computed. [2020-10-20 01:00:02,184 INFO L270 CegarLoopResult]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse3 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (let ((.cse4 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse4)))) (.cse2 (<= 1 ULTIMATE.start_main_~main__j~0)) (.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (= ULTIMATE.start_main_~main__j~0 0) (<= 0 ULTIMATE.start_main_~main__i~0) (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) .cse0) (and .cse1 .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse0) (and .cse3 .cse1 .cse2 .cse0)))) [2020-10-20 01:00:02,185 INFO L274 CegarLoopResult]: For program point L66(lines 66 285) no Hoare annotation was computed. [2020-10-20 01:00:02,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:00:02,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,185 INFO L274 CegarLoopResult]: For program point L215(lines 215 271) no Hoare annotation was computed. [2020-10-20 01:00:02,185 INFO L274 CegarLoopResult]: For program point L191(lines 191 275) no Hoare annotation was computed. [2020-10-20 01:00:02,186 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,186 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,186 INFO L274 CegarLoopResult]: For program point L175(lines 175 277) no Hoare annotation was computed. [2020-10-20 01:00:02,186 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:02,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:00:02 BoogieIcfgContainer [2020-10-20 01:00:02,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:00:02,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:00:02,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:00:02,222 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:00:02,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:57" (3/4) ... [2020-10-20 01:00:02,227 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:00:02,266 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:00:02,266 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:00:02,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:02,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:02,376 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:00:02,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:00:02,378 INFO L168 Benchmark]: Toolchain (without parser) took 5704.04 ms. Allocated memory was 40.4 MB in the beginning and 70.8 MB in the end (delta: 30.4 MB). Free memory was 18.5 MB in the beginning and 23.9 MB in the end (delta: -5.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,378 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 30.9 MB. Free memory was 7.2 MB in the beginning and 7.1 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.91 ms. Allocated memory was 40.4 MB in the beginning and 41.4 MB in the end (delta: 1.0 MB). Free memory was 17.6 MB in the beginning and 15.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.85 ms. Allocated memory is still 41.4 MB. Free memory was 15.3 MB in the beginning and 13.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,380 INFO L168 Benchmark]: Boogie Preprocessor took 29.31 ms. Allocated memory is still 41.4 MB. Free memory was 13.2 MB in the beginning and 11.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,381 INFO L168 Benchmark]: RCFGBuilder took 530.26 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 11.6 MB in the beginning and 17.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,381 INFO L168 Benchmark]: TraceAbstraction took 4569.94 ms. Allocated memory was 43.0 MB in the beginning and 70.8 MB in the end (delta: 27.8 MB). Free memory was 16.9 MB in the beginning and 31.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 34.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,382 INFO L168 Benchmark]: Witness Printer took 154.72 ms. Allocated memory is still 70.8 MB. Free memory was 31.7 MB in the beginning and 23.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:02,385 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 30.9 MB. Free memory was 7.2 MB in the beginning and 7.1 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 359.91 ms. Allocated memory was 40.4 MB in the beginning and 41.4 MB in the end (delta: 1.0 MB). Free memory was 17.6 MB in the beginning and 15.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 47.85 ms. Allocated memory is still 41.4 MB. Free memory was 15.3 MB in the beginning and 13.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.31 ms. Allocated memory is still 41.4 MB. Free memory was 13.2 MB in the beginning and 11.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 530.26 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 11.6 MB in the beginning and 17.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 4569.94 ms. Allocated memory was 43.0 MB in the beginning and 70.8 MB in the end (delta: 27.8 MB). Free memory was 16.9 MB in the beginning and 31.7 MB in the end (delta: -14.8 MB). Peak memory consumption was 34.7 MB. Max. memory is 14.3 GB. * Witness Printer took 154.72 ms. Allocated memory is still 70.8 MB. Free memory was 31.7 MB in the beginning and 23.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: 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: 38]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__i < main__len) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((main__j == 0 && 0 <= main__i) && main__i < main__len) && main__limit + 4 <= main__bufsize) || (((((main__j + 4 <= main__bufsize && 1 <= main__i) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize)) || (((main__j + 4 <= main__bufsize && ((main__j + 4 <= main__bufsize && 1 <= main__i) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i))) && 1 <= main__j) && main__limit + 4 <= main__bufsize) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 883 SDtfs, 1261 SDslu, 715 SDs, 0 SdLazy, 912 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 109 HoareAnnotationTreeSize, 4 FomulaSimplifications, 233044656 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 253791 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 9440 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...