./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --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/ldv-races/race-3_1-container_of-global.i -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 dd263d20067137356e96cf6640993a49b235f8dc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:09:38,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:09:38,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:09:38,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:09:38,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:09:38,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:09:38,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:09:38,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:09:38,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:09:38,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:09:38,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:09:38,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:09:38,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:09:38,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:09:38,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:09:38,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:09:38,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:09:38,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:09:38,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:09:38,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:09:38,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:09:38,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:09:38,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:09:38,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:09:38,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:09:38,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:09:38,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:09:38,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:09:38,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:09:38,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:09:38,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:09:38,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:09:38,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:09:38,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:09:38,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:09:38,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:09:38,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:09:38,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:09:38,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:09:38,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:09:38,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:09:38,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:09:38,779 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:09:38,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:09:38,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:09:38,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:09:38,783 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:09:38,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:09:38,783 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:09:38,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:09:38,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:09:38,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:09:38,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:09:38,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:09:38,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:09:38,789 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:09:38,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:09:38,790 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:09:38,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:09:38,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:09:38,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:09:38,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:09:38,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:09:38,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:09:38,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:09:38,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:09:38,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:09:38,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:09:38,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:09:38,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:09:38,792 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:09:38,792 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 -> dd263d20067137356e96cf6640993a49b235f8dc [2020-10-20 03:09:38,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:09:38,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:09:39,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:09:39,001 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:09:39,001 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:09:39,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2020-10-20 03:09:39,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfc762cd/4815df0e4d434b799ce4aef590453bd3/FLAG27cca9949 [2020-10-20 03:09:39,684 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:09:39,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2020-10-20 03:09:39,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfc762cd/4815df0e4d434b799ce4aef590453bd3/FLAG27cca9949 [2020-10-20 03:09:39,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfc762cd/4815df0e4d434b799ce4aef590453bd3 [2020-10-20 03:09:39,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:09:39,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:09:39,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:09:39,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:09:39,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:09:39,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:09:39" (1/1) ... [2020-10-20 03:09:39,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709f411d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:39, skipping insertion in model container [2020-10-20 03:09:39,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:09:39" (1/1) ... [2020-10-20 03:09:39,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:09:39,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:09:40,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:09:40,702 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:09:40,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:09:41,300 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:09:41,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41 WrapperNode [2020-10-20 03:09:41,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:09:41,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:09:41,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:09:41,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:09:41,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:09:41,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:09:41,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:09:41,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:09:41,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (1/1) ... [2020-10-20 03:09:41,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:09:41,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:09:41,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:09:41,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:09:41,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (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 03:09:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:09:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:09:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-20 03:09:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 03:09:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:09:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:09:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-20 03:09:41,504 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-20 03:09:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:09:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:09:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:09:41,506 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:09:42,189 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:09:42,189 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-20 03:09:42,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:42 BoogieIcfgContainer [2020-10-20 03:09:42,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:09:42,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:09:42,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:09:42,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:09:42,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:09:39" (1/3) ... [2020-10-20 03:09:42,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476b3ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:09:42, skipping insertion in model container [2020-10-20 03:09:42,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:09:41" (2/3) ... [2020-10-20 03:09:42,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476b3ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:09:42, skipping insertion in model container [2020-10-20 03:09:42,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:42" (3/3) ... [2020-10-20 03:09:42,201 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-20 03:09:42,212 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:09:42,212 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:09:42,220 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-20 03:09:42,221 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:09:42,253 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,253 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,257 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,257 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,260 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,261 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,261 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,261 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,261 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,265 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,265 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,265 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,266 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,266 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,267 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,267 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,268 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,268 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,268 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,272 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,273 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,274 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,274 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,275 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:09:42,295 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-20 03:09:42,309 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-20 03:09:42,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:09:42,330 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:09:42,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:09:42,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:09:42,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:09:42,331 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:09:42,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:09:42,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:09:42,349 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:09:42,352 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-20 03:09:42,355 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-20 03:09:42,357 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 178 places, 188 transitions, 398 flow [2020-10-20 03:09:42,450 INFO L129 PetriNetUnfolder]: 19/236 cut-off events. [2020-10-20 03:09:42,451 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-20 03:09:42,457 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 236 events. 19/236 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 492 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-10-20 03:09:42,463 INFO L117 LiptonReduction]: Number of co-enabled transitions 3172 [2020-10-20 03:09:43,485 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,516 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,536 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,539 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:43,563 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,590 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:43,607 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:43,608 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-20 03:09:45,977 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,005 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,024 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,025 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-20 03:09:46,048 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,079 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:46,107 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:46,108 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-20 03:09:48,284 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,314 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,337 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,337 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-20 03:09:48,353 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,386 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,410 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:48,411 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:48,411 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-20 03:09:50,778 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:50,813 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:50,832 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,832 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-20 03:09:50,848 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:50,873 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:50,893 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:50,893 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-20 03:09:51,274 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,312 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,333 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,334 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-20 03:09:51,344 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,372 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:51,390 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:51,390 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-20 03:09:54,182 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:54,214 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:54,244 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-10-20 03:09:54,255 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:54,294 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:54,318 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:54,318 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-10-20 03:09:56,352 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:56,382 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:56,400 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,400 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-20 03:09:56,413 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:56,434 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:56,452 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:56,452 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-20 03:09:58,949 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-20 03:09:59,181 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:59,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:59,204 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:59,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:09:59,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:09:59,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-20 03:09:59,529 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-20 03:09:59,908 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-10-20 03:09:59,925 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:00,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:00,016 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:00,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:00,082 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:00,082 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:160, output treesize:132 [2020-10-20 03:10:00,952 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-20 03:10:01,207 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-20 03:10:01,410 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-10-20 03:10:02,455 WARN L193 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-10-20 03:10:02,815 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:10:04,078 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2020-10-20 03:10:04,108 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:04,831 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-20 03:10:04,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:04,848 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:05,373 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:10:05,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 03:10:05,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 03:10:05,375 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-20 03:10:05,892 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-20 03:10:05,905 INFO L132 LiptonReduction]: Checked pairs total: 8034 [2020-10-20 03:10:05,905 INFO L134 LiptonReduction]: Total number of compositions: 229 [2020-10-20 03:10:05,912 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-20 03:10:05,940 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-20 03:10:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-20 03:10:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-20 03:10:05,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:05,948 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-20 03:10:05,949 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash 711, now seen corresponding path program 1 times [2020-10-20 03:10:05,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:05,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339238626] [2020-10-20 03:10:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:06,196 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 03:10:06,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339238626] [2020-10-20 03:10:06,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:06,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-20 03:10:06,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548790084] [2020-10-20 03:10:06,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 03:10:06,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 03:10:06,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:10:06,220 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-20 03:10:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:06,256 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-20 03:10:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 03:10:06,257 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-20 03:10:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:06,273 INFO L225 Difference]: With dead ends: 423 [2020-10-20 03:10:06,273 INFO L226 Difference]: Without dead ends: 385 [2020-10-20 03:10:06,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 03:10:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-20 03:10:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-20 03:10:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-20 03:10:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-20 03:10:06,349 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-20 03:10:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:06,349 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-20 03:10:06,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 03:10:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-20 03:10:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-20 03:10:06,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:06,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-20 03:10:06,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:10:06,350 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 21756108, now seen corresponding path program 1 times [2020-10-20 03:10:06,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:06,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246695620] [2020-10-20 03:10:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:06,691 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 03:10:06,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246695620] [2020-10-20 03:10:06,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:06,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:10:06,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913838095] [2020-10-20 03:10:06,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:10:06,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:10:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:10:06,694 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-20 03:10:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:06,792 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-20 03:10:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:10:06,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-20 03:10:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:06,799 INFO L225 Difference]: With dead ends: 540 [2020-10-20 03:10:06,800 INFO L226 Difference]: Without dead ends: 540 [2020-10-20 03:10:06,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 03:10:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-20 03:10:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-20 03:10:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-20 03:10:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-20 03:10:06,829 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-20 03:10:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:06,829 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-20 03:10:06,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:10:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-20 03:10:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-20 03:10:06,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:06,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-20 03:10:06,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:10:06,831 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash -567208386, now seen corresponding path program 1 times [2020-10-20 03:10:06,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:06,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500486543] [2020-10-20 03:10:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:06,923 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 03:10:06,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500486543] [2020-10-20 03:10:06,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:06,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:10:06,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366912218] [2020-10-20 03:10:06,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:10:06,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:10:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:10:06,927 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-20 03:10:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:07,068 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-20 03:10:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:10:07,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-20 03:10:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:07,076 INFO L225 Difference]: With dead ends: 599 [2020-10-20 03:10:07,077 INFO L226 Difference]: Without dead ends: 514 [2020-10-20 03:10:07,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:10:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-20 03:10:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-20 03:10:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-20 03:10:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-20 03:10:07,101 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-20 03:10:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:07,101 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-20 03:10:07,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:10:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-20 03:10:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:10:07,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:07,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:07,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:10:07,106 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 164889039, now seen corresponding path program 1 times [2020-10-20 03:10:07,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:07,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77469539] [2020-10-20 03:10:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:07,236 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 03:10:07,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77469539] [2020-10-20 03:10:07,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:07,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:10:07,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729221136] [2020-10-20 03:10:07,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:10:07,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:07,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:10:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:10:07,239 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-20 03:10:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:07,258 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-20 03:10:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:10:07,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:10:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:07,261 INFO L225 Difference]: With dead ends: 162 [2020-10-20 03:10:07,261 INFO L226 Difference]: Without dead ends: 162 [2020-10-20 03:10:07,262 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 03:10:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-20 03:10:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-20 03:10:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-20 03:10:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-20 03:10:07,270 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-20 03:10:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:07,271 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-20 03:10:07,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:10:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-20 03:10:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:07,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:07,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:07,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:10:07,282 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash -976645078, now seen corresponding path program 1 times [2020-10-20 03:10:07,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:07,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293168297] [2020-10-20 03:10:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:07,553 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 03:10:07,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293168297] [2020-10-20 03:10:07,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:07,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 03:10:07,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139210266] [2020-10-20 03:10:07,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:10:07,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:10:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:10:07,558 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-10-20 03:10:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:08,008 INFO L93 Difference]: Finished difference Result 144 states and 313 transitions. [2020-10-20 03:10:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:08,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-20 03:10:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:08,010 INFO L225 Difference]: With dead ends: 144 [2020-10-20 03:10:08,010 INFO L226 Difference]: Without dead ends: 144 [2020-10-20 03:10:08,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-20 03:10:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-20 03:10:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-20 03:10:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 313 transitions. [2020-10-20 03:10:08,021 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 313 transitions. Word has length 22 [2020-10-20 03:10:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:08,022 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 313 transitions. [2020-10-20 03:10:08,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:10:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 313 transitions. [2020-10-20 03:10:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:08,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:08,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:08,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:10:08,030 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -834725520, now seen corresponding path program 1 times [2020-10-20 03:10:08,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:08,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819220131] [2020-10-20 03:10:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:08,211 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 03:10:08,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819220131] [2020-10-20 03:10:08,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:08,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:10:08,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675657169] [2020-10-20 03:10:08,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:10:08,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:10:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:10:08,213 INFO L87 Difference]: Start difference. First operand 144 states and 313 transitions. Second operand 4 states. [2020-10-20 03:10:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:08,237 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2020-10-20 03:10:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:10:08,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-20 03:10:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:08,238 INFO L225 Difference]: With dead ends: 96 [2020-10-20 03:10:08,238 INFO L226 Difference]: Without dead ends: 96 [2020-10-20 03:10:08,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:10:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-20 03:10:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-20 03:10:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 03:10:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2020-10-20 03:10:08,242 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 161 transitions. Word has length 22 [2020-10-20 03:10:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:08,243 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 161 transitions. [2020-10-20 03:10:08,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:10:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 161 transitions. [2020-10-20 03:10:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:08,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:08,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:08,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:10:08,244 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash 663150838, now seen corresponding path program 2 times [2020-10-20 03:10:08,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:08,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571675467] [2020-10-20 03:10:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:08,960 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 03:10:08,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571675467] [2020-10-20 03:10:08,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:08,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:10:08,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195520463] [2020-10-20 03:10:08,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:10:08,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:10:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:08,963 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand 11 states. [2020-10-20 03:10:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:09,513 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2020-10-20 03:10:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:09,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 03:10:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:09,516 INFO L225 Difference]: With dead ends: 128 [2020-10-20 03:10:09,516 INFO L226 Difference]: Without dead ends: 128 [2020-10-20 03:10:09,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-10-20 03:10:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-20 03:10:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2020-10-20 03:10:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-20 03:10:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 210 transitions. [2020-10-20 03:10:09,521 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 210 transitions. Word has length 22 [2020-10-20 03:10:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:09,521 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 210 transitions. [2020-10-20 03:10:09,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:10:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2020-10-20 03:10:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:09,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:09,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:09,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:10:09,523 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 663150822, now seen corresponding path program 1 times [2020-10-20 03:10:09,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:09,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427938941] [2020-10-20 03:10:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:09,703 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 03:10:09,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427938941] [2020-10-20 03:10:09,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:09,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:09,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445106748] [2020-10-20 03:10:09,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:09,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:09,707 INFO L87 Difference]: Start difference. First operand 127 states and 210 transitions. Second operand 8 states. [2020-10-20 03:10:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:10,019 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2020-10-20 03:10:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:10:10,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:10,021 INFO L225 Difference]: With dead ends: 164 [2020-10-20 03:10:10,022 INFO L226 Difference]: Without dead ends: 136 [2020-10-20 03:10:10,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-20 03:10:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-10-20 03:10:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 03:10:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 200 transitions. [2020-10-20 03:10:10,028 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 200 transitions. Word has length 22 [2020-10-20 03:10:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:10,028 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 200 transitions. [2020-10-20 03:10:10,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 200 transitions. [2020-10-20 03:10:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:10,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:10,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:10,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:10:10,030 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:10,031 INFO L82 PathProgramCache]: Analyzing trace with hash -917977872, now seen corresponding path program 3 times [2020-10-20 03:10:10,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:10,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644616750] [2020-10-20 03:10:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:10,401 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 03:10:10,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644616750] [2020-10-20 03:10:10,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:10,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:10:10,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112452421] [2020-10-20 03:10:10,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:10:10,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:10:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:10,403 INFO L87 Difference]: Start difference. First operand 121 states and 200 transitions. Second operand 11 states. [2020-10-20 03:10:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:10,989 INFO L93 Difference]: Finished difference Result 189 states and 307 transitions. [2020-10-20 03:10:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:10,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 03:10:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:10,992 INFO L225 Difference]: With dead ends: 189 [2020-10-20 03:10:10,992 INFO L226 Difference]: Without dead ends: 189 [2020-10-20 03:10:10,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-20 03:10:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2020-10-20 03:10:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-20 03:10:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 242 transitions. [2020-10-20 03:10:10,997 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 242 transitions. Word has length 22 [2020-10-20 03:10:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:10,998 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 242 transitions. [2020-10-20 03:10:10,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:10:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 242 transitions. [2020-10-20 03:10:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:10,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:10,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:10,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:10:11,000 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash -917977888, now seen corresponding path program 2 times [2020-10-20 03:10:11,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:11,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878409460] [2020-10-20 03:10:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:11,169 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 03:10:11,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878409460] [2020-10-20 03:10:11,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:11,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:11,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170685453] [2020-10-20 03:10:11,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:11,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:11,171 INFO L87 Difference]: Start difference. First operand 147 states and 242 transitions. Second operand 8 states. [2020-10-20 03:10:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:11,404 INFO L93 Difference]: Finished difference Result 195 states and 303 transitions. [2020-10-20 03:10:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:10:11,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:11,406 INFO L225 Difference]: With dead ends: 195 [2020-10-20 03:10:11,406 INFO L226 Difference]: Without dead ends: 181 [2020-10-20 03:10:11,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-20 03:10:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2020-10-20 03:10:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-20 03:10:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-20 03:10:11,412 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-20 03:10:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:11,412 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-20 03:10:11,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-20 03:10:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:11,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:11,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:11,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:10:11,414 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1049502960, now seen corresponding path program 4 times [2020-10-20 03:10:11,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:11,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316193167] [2020-10-20 03:10:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:11,871 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 03:10:11,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316193167] [2020-10-20 03:10:11,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:11,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:10:11,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352351439] [2020-10-20 03:10:11,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:10:11,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:11,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:10:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:11,874 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 11 states. [2020-10-20 03:10:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:12,541 INFO L93 Difference]: Finished difference Result 190 states and 307 transitions. [2020-10-20 03:10:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 03:10:12,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 03:10:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:12,543 INFO L225 Difference]: With dead ends: 190 [2020-10-20 03:10:12,543 INFO L226 Difference]: Without dead ends: 174 [2020-10-20 03:10:12,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-20 03:10:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2020-10-20 03:10:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-20 03:10:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 219 transitions. [2020-10-20 03:10:12,548 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 219 transitions. Word has length 22 [2020-10-20 03:10:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:12,548 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 219 transitions. [2020-10-20 03:10:12,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:10:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 219 transitions. [2020-10-20 03:10:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:12,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:12,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:12,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:10:12,550 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1225918624, now seen corresponding path program 5 times [2020-10-20 03:10:12,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:12,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485407182] [2020-10-20 03:10:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:12,961 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 03:10:12,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485407182] [2020-10-20 03:10:12,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:12,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:10:12,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599433443] [2020-10-20 03:10:12,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:10:12,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:10:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:12,963 INFO L87 Difference]: Start difference. First operand 133 states and 219 transitions. Second operand 11 states. [2020-10-20 03:10:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:13,525 INFO L93 Difference]: Finished difference Result 183 states and 296 transitions. [2020-10-20 03:10:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:13,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 03:10:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:13,528 INFO L225 Difference]: With dead ends: 183 [2020-10-20 03:10:13,528 INFO L226 Difference]: Without dead ends: 163 [2020-10-20 03:10:13,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-20 03:10:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-20 03:10:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2020-10-20 03:10:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-20 03:10:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 249 transitions. [2020-10-20 03:10:13,534 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 249 transitions. Word has length 22 [2020-10-20 03:10:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:13,534 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 249 transitions. [2020-10-20 03:10:13,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:10:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 249 transitions. [2020-10-20 03:10:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:13,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:13,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:13,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:10:13,536 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1794260320, now seen corresponding path program 3 times [2020-10-20 03:10:13,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:13,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418055292] [2020-10-20 03:10:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:13,681 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 03:10:13,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418055292] [2020-10-20 03:10:13,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:13,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:13,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27971686] [2020-10-20 03:10:13,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:13,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:13,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:13,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:13,684 INFO L87 Difference]: Start difference. First operand 153 states and 249 transitions. Second operand 8 states. [2020-10-20 03:10:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:13,948 INFO L93 Difference]: Finished difference Result 203 states and 309 transitions. [2020-10-20 03:10:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:10:13,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:13,950 INFO L225 Difference]: With dead ends: 203 [2020-10-20 03:10:13,950 INFO L226 Difference]: Without dead ends: 179 [2020-10-20 03:10:13,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-20 03:10:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2020-10-20 03:10:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-20 03:10:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 183 transitions. [2020-10-20 03:10:13,963 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 183 transitions. Word has length 22 [2020-10-20 03:10:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:13,964 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 183 transitions. [2020-10-20 03:10:13,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 183 transitions. [2020-10-20 03:10:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:13,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:13,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:13,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:10:13,966 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1157540390, now seen corresponding path program 6 times [2020-10-20 03:10:13,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:13,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049129485] [2020-10-20 03:10:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:14,353 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 03:10:14,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049129485] [2020-10-20 03:10:14,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:14,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 03:10:14,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323783809] [2020-10-20 03:10:14,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 03:10:14,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 03:10:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:14,357 INFO L87 Difference]: Start difference. First operand 113 states and 183 transitions. Second operand 11 states. [2020-10-20 03:10:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:15,036 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2020-10-20 03:10:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 03:10:15,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-20 03:10:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:15,037 INFO L225 Difference]: With dead ends: 140 [2020-10-20 03:10:15,038 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 03:10:15,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-20 03:10:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 03:10:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 03:10:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 03:10:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-10-20 03:10:15,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 22 [2020-10-20 03:10:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:15,043 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-20 03:10:15,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 03:10:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2020-10-20 03:10:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:15,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:15,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:15,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:10:15,044 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 698584272, now seen corresponding path program 7 times [2020-10-20 03:10:15,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:15,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137079247] [2020-10-20 03:10:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:15,693 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 03:10:15,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137079247] [2020-10-20 03:10:15,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:15,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:15,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342163241] [2020-10-20 03:10:15,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:15,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:15,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:15,696 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand 12 states. [2020-10-20 03:10:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:16,284 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2020-10-20 03:10:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:16,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:16,286 INFO L225 Difference]: With dead ends: 129 [2020-10-20 03:10:16,286 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 03:10:16,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 03:10:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 03:10:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 03:10:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2020-10-20 03:10:16,290 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 162 transitions. Word has length 22 [2020-10-20 03:10:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:16,290 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-20 03:10:16,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 162 transitions. [2020-10-20 03:10:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:16,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:16,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:16,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:10:16,292 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -882544438, now seen corresponding path program 8 times [2020-10-20 03:10:16,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:16,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051446701] [2020-10-20 03:10:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:16,669 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 03:10:16,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051446701] [2020-10-20 03:10:16,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:16,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:16,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361172572] [2020-10-20 03:10:16,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:16,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:16,672 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. Second operand 12 states. [2020-10-20 03:10:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:17,300 INFO L93 Difference]: Finished difference Result 120 states and 186 transitions. [2020-10-20 03:10:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:17,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:17,302 INFO L225 Difference]: With dead ends: 120 [2020-10-20 03:10:17,302 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 03:10:17,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 03:10:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2020-10-20 03:10:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-20 03:10:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 154 transitions. [2020-10-20 03:10:17,306 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 154 transitions. Word has length 22 [2020-10-20 03:10:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:17,306 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 154 transitions. [2020-10-20 03:10:17,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 154 transitions. [2020-10-20 03:10:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:17,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:17,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:17,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:10:17,308 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:17,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1084936394, now seen corresponding path program 9 times [2020-10-20 03:10:17,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:17,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867462545] [2020-10-20 03:10:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:17,793 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 03:10:17,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867462545] [2020-10-20 03:10:17,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:17,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:17,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708107555] [2020-10-20 03:10:17,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:17,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:17,796 INFO L87 Difference]: Start difference. First operand 97 states and 154 transitions. Second operand 12 states. [2020-10-20 03:10:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:18,502 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2020-10-20 03:10:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 03:10:18,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:18,504 INFO L225 Difference]: With dead ends: 120 [2020-10-20 03:10:18,504 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 03:10:18,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 03:10:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2020-10-20 03:10:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 03:10:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2020-10-20 03:10:18,508 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 22 [2020-10-20 03:10:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:18,509 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2020-10-20 03:10:18,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2020-10-20 03:10:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:18,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:18,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:18,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:10:18,512 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1190485190, now seen corresponding path program 10 times [2020-10-20 03:10:18,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:18,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860438394] [2020-10-20 03:10:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:19,032 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 03:10:19,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860438394] [2020-10-20 03:10:19,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:19,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:19,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141106958] [2020-10-20 03:10:19,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:19,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:19,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:19,034 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand 12 states. [2020-10-20 03:10:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:19,677 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2020-10-20 03:10:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:19,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:19,679 INFO L225 Difference]: With dead ends: 117 [2020-10-20 03:10:19,679 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 03:10:19,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 03:10:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-20 03:10:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 03:10:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2020-10-20 03:10:19,683 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 22 [2020-10-20 03:10:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:19,684 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2020-10-20 03:10:19,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2020-10-20 03:10:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:19,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:19,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:19,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 03:10:19,685 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1122106956, now seen corresponding path program 11 times [2020-10-20 03:10:19,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:19,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690331028] [2020-10-20 03:10:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:20,171 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 03:10:20,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690331028] [2020-10-20 03:10:20,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:20,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:20,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98091358] [2020-10-20 03:10:20,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:20,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:20,174 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand 12 states. [2020-10-20 03:10:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:20,773 INFO L93 Difference]: Finished difference Result 118 states and 183 transitions. [2020-10-20 03:10:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:20,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:20,774 INFO L225 Difference]: With dead ends: 118 [2020-10-20 03:10:20,775 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 03:10:20,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 03:10:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-20 03:10:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-20 03:10:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2020-10-20 03:10:20,778 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 22 [2020-10-20 03:10:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:20,779 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2020-10-20 03:10:20,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2020-10-20 03:10:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:20,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:20,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:20,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 03:10:20,780 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash 131238104, now seen corresponding path program 12 times [2020-10-20 03:10:20,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:20,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932940022] [2020-10-20 03:10:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:21,516 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 03:10:21,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932940022] [2020-10-20 03:10:21,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:21,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:21,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239364482] [2020-10-20 03:10:21,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:21,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:21,520 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand 12 states. [2020-10-20 03:10:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:22,151 INFO L93 Difference]: Finished difference Result 112 states and 169 transitions. [2020-10-20 03:10:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:22,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:22,152 INFO L225 Difference]: With dead ends: 112 [2020-10-20 03:10:22,152 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 03:10:22,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-20 03:10:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 03:10:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 03:10:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 03:10:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2020-10-20 03:10:22,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 22 [2020-10-20 03:10:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:22,155 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2020-10-20 03:10:22,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2020-10-20 03:10:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:22,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:22,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:22,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 03:10:22,156 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash 566019722, now seen corresponding path program 13 times [2020-10-20 03:10:22,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:22,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506591247] [2020-10-20 03:10:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:22,680 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 03:10:22,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506591247] [2020-10-20 03:10:22,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:22,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:22,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219266711] [2020-10-20 03:10:22,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:22,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:22,683 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 12 states. [2020-10-20 03:10:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:23,316 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2020-10-20 03:10:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 03:10:23,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:23,318 INFO L225 Difference]: With dead ends: 83 [2020-10-20 03:10:23,318 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 03:10:23,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 03:10:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2020-10-20 03:10:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-20 03:10:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-10-20 03:10:23,322 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 22 [2020-10-20 03:10:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:23,323 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-10-20 03:10:23,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-10-20 03:10:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:23,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:23,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:23,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 03:10:23,324 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash 566019706, now seen corresponding path program 4 times [2020-10-20 03:10:23,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:23,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20652535] [2020-10-20 03:10:23,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:23,557 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 03:10:23,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20652535] [2020-10-20 03:10:23,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:23,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:23,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425897721] [2020-10-20 03:10:23,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:23,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:23,561 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand 8 states. [2020-10-20 03:10:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:23,828 INFO L93 Difference]: Finished difference Result 92 states and 125 transitions. [2020-10-20 03:10:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:10:23,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:23,829 INFO L225 Difference]: With dead ends: 92 [2020-10-20 03:10:23,829 INFO L226 Difference]: Without dead ends: 84 [2020-10-20 03:10:23,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-20 03:10:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-20 03:10:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2020-10-20 03:10:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 03:10:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2020-10-20 03:10:23,833 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 22 [2020-10-20 03:10:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:23,833 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2020-10-20 03:10:23,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2020-10-20 03:10:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:23,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:23,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:23,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 03:10:23,835 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -616705242, now seen corresponding path program 14 times [2020-10-20 03:10:23,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:23,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995195739] [2020-10-20 03:10:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:24,206 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 03:10:24,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995195739] [2020-10-20 03:10:24,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:24,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:24,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258335068] [2020-10-20 03:10:24,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:24,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:24,208 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand 12 states. [2020-10-20 03:10:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:24,756 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2020-10-20 03:10:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:24,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:24,757 INFO L225 Difference]: With dead ends: 86 [2020-10-20 03:10:24,757 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 03:10:24,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 03:10:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-10-20 03:10:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 03:10:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2020-10-20 03:10:24,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 22 [2020-10-20 03:10:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:24,760 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2020-10-20 03:10:24,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2020-10-20 03:10:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:24,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:24,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:24,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 03:10:24,761 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1517132414, now seen corresponding path program 15 times [2020-10-20 03:10:24,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:24,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732188928] [2020-10-20 03:10:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:25,191 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 03:10:25,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732188928] [2020-10-20 03:10:25,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:25,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:25,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085944222] [2020-10-20 03:10:25,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:25,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:25,194 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand 12 states. [2020-10-20 03:10:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:25,804 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2020-10-20 03:10:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 03:10:25,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:25,806 INFO L225 Difference]: With dead ends: 88 [2020-10-20 03:10:25,806 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 03:10:25,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 03:10:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-10-20 03:10:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 03:10:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2020-10-20 03:10:25,809 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 22 [2020-10-20 03:10:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:25,809 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2020-10-20 03:10:25,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2020-10-20 03:10:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:25,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:25,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:25,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 03:10:25,810 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1024190236, now seen corresponding path program 5 times [2020-10-20 03:10:25,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:25,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591488537] [2020-10-20 03:10:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:25,977 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 03:10:25,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591488537] [2020-10-20 03:10:25,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:25,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:25,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726605690] [2020-10-20 03:10:25,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:25,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:25,981 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand 8 states. [2020-10-20 03:10:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:26,371 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2020-10-20 03:10:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:10:26,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:26,373 INFO L225 Difference]: With dead ends: 76 [2020-10-20 03:10:26,374 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 03:10:26,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 03:10:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-20 03:10:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 03:10:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-10-20 03:10:26,378 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 22 [2020-10-20 03:10:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:26,378 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-10-20 03:10:26,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-10-20 03:10:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:26,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:26,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:26,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 03:10:26,380 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash -304507168, now seen corresponding path program 16 times [2020-10-20 03:10:26,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:26,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898723361] [2020-10-20 03:10:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:26,931 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 03:10:26,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898723361] [2020-10-20 03:10:26,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:26,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:26,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160271782] [2020-10-20 03:10:26,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:26,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:26,935 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand 12 states. [2020-10-20 03:10:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:27,705 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2020-10-20 03:10:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 03:10:27,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:27,706 INFO L225 Difference]: With dead ends: 77 [2020-10-20 03:10:27,706 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 03:10:27,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-20 03:10:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 03:10:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-10-20 03:10:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 03:10:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2020-10-20 03:10:27,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 22 [2020-10-20 03:10:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:27,709 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2020-10-20 03:10:27,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-10-20 03:10:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:27,710 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:27,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:27,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 03:10:27,710 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash -304507184, now seen corresponding path program 6 times [2020-10-20 03:10:27,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:27,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133239489] [2020-10-20 03:10:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:27,874 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 03:10:27,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133239489] [2020-10-20 03:10:27,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:27,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:10:27,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454312018] [2020-10-20 03:10:27,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:10:27,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:10:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:10:27,876 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 8 states. [2020-10-20 03:10:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:28,103 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2020-10-20 03:10:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:10:28,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-20 03:10:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:28,105 INFO L225 Difference]: With dead ends: 75 [2020-10-20 03:10:28,105 INFO L226 Difference]: Without dead ends: 59 [2020-10-20 03:10:28,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-20 03:10:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-10-20 03:10:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 03:10:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2020-10-20 03:10:28,108 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 22 [2020-10-20 03:10:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:28,108 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2020-10-20 03:10:28,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:10:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2020-10-20 03:10:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:28,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:28,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:28,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 03:10:28,109 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1003507688, now seen corresponding path program 17 times [2020-10-20 03:10:28,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:28,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664073855] [2020-10-20 03:10:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:28,522 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 03:10:28,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664073855] [2020-10-20 03:10:28,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:28,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:28,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284176510] [2020-10-20 03:10:28,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:28,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:28,524 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 12 states. [2020-10-20 03:10:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:29,079 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-10-20 03:10:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 03:10:29,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:29,080 INFO L225 Difference]: With dead ends: 66 [2020-10-20 03:10:29,080 INFO L226 Difference]: Without dead ends: 51 [2020-10-20 03:10:29,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-20 03:10:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-20 03:10:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 03:10:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2020-10-20 03:10:29,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 22 [2020-10-20 03:10:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:29,083 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2020-10-20 03:10:29,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2020-10-20 03:10:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:29,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:29,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:29,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 03:10:29,084 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 35529654, now seen corresponding path program 18 times [2020-10-20 03:10:29,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:29,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130634278] [2020-10-20 03:10:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:29,505 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 03:10:29,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130634278] [2020-10-20 03:10:29,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:29,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:29,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185225081] [2020-10-20 03:10:29,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:29,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:29,507 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 12 states. [2020-10-20 03:10:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:30,117 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2020-10-20 03:10:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:30,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:30,118 INFO L225 Difference]: With dead ends: 66 [2020-10-20 03:10:30,118 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 03:10:30,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 03:10:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-20 03:10:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 03:10:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 03:10:30,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2020-10-20 03:10:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:30,121 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 03:10:30,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 03:10:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:30,122 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:30,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:30,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 03:10:30,123 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1172676456, now seen corresponding path program 19 times [2020-10-20 03:10:30,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:30,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567523729] [2020-10-20 03:10:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:30,528 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 03:10:30,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567523729] [2020-10-20 03:10:30,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:30,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:30,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939173598] [2020-10-20 03:10:30,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:30,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:30,530 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 12 states. [2020-10-20 03:10:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:31,032 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-20 03:10:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:31,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:31,033 INFO L225 Difference]: With dead ends: 53 [2020-10-20 03:10:31,033 INFO L226 Difference]: Without dead ends: 38 [2020-10-20 03:10:31,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-20 03:10:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-20 03:10:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 03:10:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2020-10-20 03:10:31,036 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2020-10-20 03:10:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:31,036 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2020-10-20 03:10:31,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2020-10-20 03:10:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 03:10:31,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:10:31,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:10:31,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 03:10:31,037 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:10:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:10:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 552705304, now seen corresponding path program 20 times [2020-10-20 03:10:31,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:10:31,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213313492] [2020-10-20 03:10:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:10:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:10:31,553 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 03:10:31,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213313492] [2020-10-20 03:10:31,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:10:31,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 03:10:31,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939378061] [2020-10-20 03:10:31,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 03:10:31,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:10:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 03:10:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:10:31,555 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 12 states. [2020-10-20 03:10:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:10:32,069 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-10-20 03:10:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:10:32,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 03:10:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:10:32,071 INFO L225 Difference]: With dead ends: 37 [2020-10-20 03:10:32,071 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 03:10:32,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-20 03:10:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 03:10:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 03:10:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 03:10:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 03:10:32,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-20 03:10:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:10:32,073 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 03:10:32,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 03:10:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 03:10:32,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 03:10:32,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 03:10:32,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:10:32 BasicIcfg [2020-10-20 03:10:32,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:10:32,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:10:32,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:10:32,078 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:10:32,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:09:42" (3/4) ... [2020-10-20 03:10:32,082 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 03:10:32,090 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2020-10-20 03:10:32,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2020-10-20 03:10:32,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-20 03:10:32,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:10:32,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 03:10:32,150 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:10:32,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:10:32,152 INFO L168 Benchmark]: Toolchain (without parser) took 52256.73 ms. Allocated memory was 35.7 MB in the beginning and 205.0 MB in the end (delta: 169.3 MB). Free memory was 12.9 MB in the beginning and 154.5 MB in the end (delta: -141.6 MB). Peak memory consumption was 27.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,153 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 34.1 MB. Free memory was 10.1 MB in the beginning and 10.1 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1396.45 ms. Allocated memory was 35.7 MB in the beginning and 66.1 MB in the end (delta: 30.4 MB). Free memory was 12.0 MB in the beginning and 32.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.42 ms. Allocated memory is still 66.1 MB. Free memory was 32.2 MB in the beginning and 28.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,154 INFO L168 Benchmark]: Boogie Preprocessor took 48.40 ms. Allocated memory is still 66.1 MB. Free memory was 28.8 MB in the beginning and 26.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,155 INFO L168 Benchmark]: RCFGBuilder took 771.35 ms. Allocated memory was 66.1 MB in the beginning and 70.3 MB in the end (delta: 4.2 MB). Free memory was 26.0 MB in the beginning and 31.4 MB in the end (delta: -5.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,155 INFO L168 Benchmark]: TraceAbstraction took 49884.33 ms. Allocated memory was 70.3 MB in the beginning and 205.0 MB in the end (delta: 134.7 MB). Free memory was 30.8 MB in the beginning and 160.9 MB in the end (delta: -130.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,156 INFO L168 Benchmark]: Witness Printer took 72.87 ms. Allocated memory is still 205.0 MB. Free memory was 160.9 MB in the beginning and 154.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:10:32,158 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.19 ms. Allocated memory is still 34.1 MB. Free memory was 10.1 MB in the beginning and 10.1 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 1396.45 ms. Allocated memory was 35.7 MB in the beginning and 66.1 MB in the end (delta: 30.4 MB). Free memory was 12.0 MB in the beginning and 32.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 70.42 ms. Allocated memory is still 66.1 MB. Free memory was 32.2 MB in the beginning and 28.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 48.40 ms. Allocated memory is still 66.1 MB. Free memory was 28.8 MB in the beginning and 26.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 771.35 ms. Allocated memory was 66.1 MB in the beginning and 70.3 MB in the end (delta: 4.2 MB). Free memory was 26.0 MB in the beginning and 31.4 MB in the end (delta: -5.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 49884.33 ms. Allocated memory was 70.3 MB in the beginning and 205.0 MB in the end (delta: 134.7 MB). Free memory was 30.8 MB in the beginning and 160.9 MB in the end (delta: -130.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 14.3 GB. * Witness Printer took 72.87 ms. Allocated memory is still 205.0 MB. Free memory was 160.9 MB in the beginning and 154.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2212 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.5s, 174 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 23.5s, 178 PlacesBefore, 41 PlacesAfterwards, 188 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 9 FixpointIterations, 118 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 22 ConcurrentYvCompositions, 11 ChoiceCompositions, 229 TotalNumberOfCompositions, 8034 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 49.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.6s, HoareTripleCheckerStatistics: 673 SDtfs, 905 SDslu, 2200 SDs, 0 SdLazy, 5702 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 22 SyntacticMatches, 46 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 385 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 264282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...