./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 701f399f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/pthread-nondet/nondet-loop-bound-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 18f8c11d6085f6594f0f2021411e68b8ac706f42 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-701f399 [2019-11-22 09:34:48,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 09:34:48,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 09:34:48,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 09:34:48,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 09:34:48,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 09:34:48,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 09:34:48,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 09:34:48,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 09:34:48,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 09:34:48,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 09:34:48,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 09:34:48,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 09:34:48,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 09:34:48,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 09:34:48,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 09:34:48,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 09:34:48,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 09:34:48,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 09:34:48,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 09:34:48,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 09:34:48,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 09:34:48,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 09:34:48,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 09:34:48,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 09:34:48,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 09:34:48,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 09:34:48,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 09:34:48,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 09:34:48,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 09:34:48,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 09:34:48,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 09:34:48,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 09:34:48,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 09:34:48,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 09:34:48,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 09:34:48,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 09:34:48,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 09:34:48,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 09:34:48,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 09:34:48,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 09:34:48,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-22 09:34:48,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 09:34:48,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 09:34:48,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 09:34:48,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 09:34:48,599 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 09:34:48,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 09:34:48,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 09:34:48,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 09:34:48,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-22 09:34:48,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 09:34:48,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-22 09:34:48,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-22 09:34:48,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 09:34:48,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-22 09:34:48,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 09:34:48,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 09:34:48,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 09:34:48,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 09:34:48,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 09:34:48,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 09:34:48,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 09:34:48,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-22 09:34:48,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 09:34:48,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 09:34:48,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-22 09:34:48,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 09:34:48,609 INFO L138 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18f8c11d6085f6594f0f2021411e68b8ac706f42 [2019-11-22 09:34:48,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 09:34:48,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 09:34:48,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 09:34:48,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 09:34:48,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 09:34:48,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 09:34:48,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e51f6b9d7/7dfa84ad8a094b90af8bf953a5ee554a/FLAG32e1ac9b8 [2019-11-22 09:34:49,462 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 09:34:49,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2019-11-22 09:34:49,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e51f6b9d7/7dfa84ad8a094b90af8bf953a5ee554a/FLAG32e1ac9b8 [2019-11-22 09:34:49,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e51f6b9d7/7dfa84ad8a094b90af8bf953a5ee554a [2019-11-22 09:34:49,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 09:34:49,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-22 09:34:49,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 09:34:49,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 09:34:49,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 09:34:49,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:49" (1/1) ... [2019-11-22 09:34:49,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574f5a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:49, skipping insertion in model container [2019-11-22 09:34:49,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:49" (1/1) ... [2019-11-22 09:34:49,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 09:34:49,912 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-22 09:34:50,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:34:50,325 INFO L201 MainTranslator]: Completed pre-run [2019-11-22 09:34:50,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 09:34:50,460 INFO L205 MainTranslator]: Completed translation [2019-11-22 09:34:50,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50 WrapperNode [2019-11-22 09:34:50,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 09:34:50,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-22 09:34:50,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-22 09:34:50,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-22 09:34:50,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-22 09:34:50,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 09:34:50,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 09:34:50,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 09:34:50,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (1/1) ... [2019-11-22 09:34:50,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 09:34:50,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 09:34:50,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 09:34:50,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 09:34:50,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (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 [2019-11-22 09:34:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-11-22 09:34:50,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-11-22 09:34:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-22 09:34:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-22 09:34:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 09:34:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 09:34:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 09:34:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 09:34:50,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 09:34:50,613 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-22 09:34:50,943 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 09:34:50,943 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-22 09:34:50,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:50 BoogieIcfgContainer [2019-11-22 09:34:50,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 09:34:50,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 09:34:50,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 09:34:50,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 09:34:50,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:34:49" (1/3) ... [2019-11-22 09:34:50,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652b4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:50, skipping insertion in model container [2019-11-22 09:34:50,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:50" (2/3) ... [2019-11-22 09:34:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652b4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:50, skipping insertion in model container [2019-11-22 09:34:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:50" (3/3) ... [2019-11-22 09:34:50,952 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-11-22 09:34:50,993 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,994 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,995 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,995 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,995 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,997 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:50,997 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,001 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-22 09:34:51,054 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-22 09:34:51,055 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 09:34:51,061 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-22 09:34:51,072 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-22 09:34:51,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 09:34:51,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-22 09:34:51,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 09:34:51,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 09:34:51,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 09:34:51,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 09:34:51,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 09:34:51,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 09:34:51,103 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions [2019-11-22 09:34:54,761 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34966 states. [2019-11-22 09:34:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34966 states. [2019-11-22 09:34:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 09:34:54,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:34:54,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:34:54,772 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:34:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:34:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash -902852624, now seen corresponding path program 1 times [2019-11-22 09:34:54,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:34:54,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931271363] [2019-11-22 09:34:54,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:34:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:34:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:34:55,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931271363] [2019-11-22 09:34:55,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:34:55,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 09:34:55,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726865737] [2019-11-22 09:34:55,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 09:34:55,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:34:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 09:34:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 09:34:55,091 INFO L87 Difference]: Start difference. First operand 34966 states. Second operand 6 states. [2019-11-22 09:34:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:34:56,347 INFO L93 Difference]: Finished difference Result 45470 states and 184962 transitions. [2019-11-22 09:34:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 09:34:56,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-22 09:34:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:34:56,639 INFO L225 Difference]: With dead ends: 45470 [2019-11-22 09:34:56,639 INFO L226 Difference]: Without dead ends: 20819 [2019-11-22 09:34:56,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-22 09:34:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20819 states. [2019-11-22 09:34:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20819 to 20819. [2019-11-22 09:34:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-11-22 09:34:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 82977 transitions. [2019-11-22 09:34:57,823 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 82977 transitions. Word has length 25 [2019-11-22 09:34:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:34:57,826 INFO L462 AbstractCegarLoop]: Abstraction has 20819 states and 82977 transitions. [2019-11-22 09:34:57,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 09:34:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 82977 transitions. [2019-11-22 09:34:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 09:34:57,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:34:57,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:34:57,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:34:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:34:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1950343494, now seen corresponding path program 1 times [2019-11-22 09:34:57,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:34:57,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772781137] [2019-11-22 09:34:57,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:34:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:34:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:34:58,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772781137] [2019-11-22 09:34:58,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:34:58,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 09:34:58,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681192024] [2019-11-22 09:34:58,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:34:58,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:34:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:34:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:34:58,081 INFO L87 Difference]: Start difference. First operand 20819 states and 82977 transitions. Second operand 8 states. [2019-11-22 09:34:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:34:59,593 INFO L93 Difference]: Finished difference Result 35069 states and 134196 transitions. [2019-11-22 09:34:59,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:34:59,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-22 09:34:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:34:59,743 INFO L225 Difference]: With dead ends: 35069 [2019-11-22 09:34:59,743 INFO L226 Difference]: Without dead ends: 28819 [2019-11-22 09:34:59,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:34:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28819 states. [2019-11-22 09:35:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28819 to 19249. [2019-11-22 09:35:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19249 states. [2019-11-22 09:35:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19249 states to 19249 states and 75732 transitions. [2019-11-22 09:35:00,662 INFO L78 Accepts]: Start accepts. Automaton has 19249 states and 75732 transitions. Word has length 34 [2019-11-22 09:35:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:00,662 INFO L462 AbstractCegarLoop]: Abstraction has 19249 states and 75732 transitions. [2019-11-22 09:35:00,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:35:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19249 states and 75732 transitions. [2019-11-22 09:35:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 09:35:00,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:00,668 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:00,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1707268840, now seen corresponding path program 1 times [2019-11-22 09:35:00,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:00,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882956739] [2019-11-22 09:35:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:00,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882956739] [2019-11-22 09:35:00,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:00,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 09:35:00,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614777083] [2019-11-22 09:35:00,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:35:00,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:00,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:35:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:35:00,839 INFO L87 Difference]: Start difference. First operand 19249 states and 75732 transitions. Second operand 8 states. [2019-11-22 09:35:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:01,298 INFO L93 Difference]: Finished difference Result 31729 states and 119978 transitions. [2019-11-22 09:35:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:35:01,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-22 09:35:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:01,434 INFO L225 Difference]: With dead ends: 31729 [2019-11-22 09:35:01,435 INFO L226 Difference]: Without dead ends: 25345 [2019-11-22 09:35:01,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:35:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-11-22 09:35:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 17369. [2019-11-22 09:35:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17369 states. [2019-11-22 09:35:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 66928 transitions. [2019-11-22 09:35:02,604 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 66928 transitions. Word has length 41 [2019-11-22 09:35:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:02,605 INFO L462 AbstractCegarLoop]: Abstraction has 17369 states and 66928 transitions. [2019-11-22 09:35:02,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:35:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 66928 transitions. [2019-11-22 09:35:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 09:35:02,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:02,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:02,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash -539445418, now seen corresponding path program 1 times [2019-11-22 09:35:02,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:02,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730741617] [2019-11-22 09:35:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:35:02,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730741617] [2019-11-22 09:35:02,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587574462] [2019-11-22 09:35:02,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:02,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:35:02,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:35:03,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:35:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 09:35:03,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:35:03,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 09:35:03,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331543671] [2019-11-22 09:35:03,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 09:35:03,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 09:35:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:35:03,148 INFO L87 Difference]: Start difference. First operand 17369 states and 66928 transitions. Second operand 18 states. [2019-11-22 09:35:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:04,078 INFO L93 Difference]: Finished difference Result 34675 states and 128863 transitions. [2019-11-22 09:35:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:04,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-22 09:35:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:04,221 INFO L225 Difference]: With dead ends: 34675 [2019-11-22 09:35:04,222 INFO L226 Difference]: Without dead ends: 32095 [2019-11-22 09:35:04,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 09:35:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2019-11-22 09:35:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16565. [2019-11-22 09:35:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16565 states. [2019-11-22 09:35:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16565 states to 16565 states and 63900 transitions. [2019-11-22 09:35:05,693 INFO L78 Accepts]: Start accepts. Automaton has 16565 states and 63900 transitions. Word has length 45 [2019-11-22 09:35:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:05,695 INFO L462 AbstractCegarLoop]: Abstraction has 16565 states and 63900 transitions. [2019-11-22 09:35:05,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 09:35:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16565 states and 63900 transitions. [2019-11-22 09:35:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 09:35:05,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:05,700 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:05,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:05,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -548416362, now seen corresponding path program 2 times [2019-11-22 09:35:05,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:05,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046789465] [2019-11-22 09:35:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:06,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046789465] [2019-11-22 09:35:06,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:06,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 09:35:06,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729342436] [2019-11-22 09:35:06,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:35:06,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:06,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:35:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:35:06,057 INFO L87 Difference]: Start difference. First operand 16565 states and 63900 transitions. Second operand 10 states. [2019-11-22 09:35:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:06,626 INFO L93 Difference]: Finished difference Result 32695 states and 121435 transitions. [2019-11-22 09:35:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:06,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-22 09:35:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:06,740 INFO L225 Difference]: With dead ends: 32695 [2019-11-22 09:35:06,740 INFO L226 Difference]: Without dead ends: 29971 [2019-11-22 09:35:06,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 09:35:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-11-22 09:35:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 13517. [2019-11-22 09:35:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13517 states. [2019-11-22 09:35:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13517 states to 13517 states and 52896 transitions. [2019-11-22 09:35:07,337 INFO L78 Accepts]: Start accepts. Automaton has 13517 states and 52896 transitions. Word has length 45 [2019-11-22 09:35:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:07,338 INFO L462 AbstractCegarLoop]: Abstraction has 13517 states and 52896 transitions. [2019-11-22 09:35:07,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:35:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 13517 states and 52896 transitions. [2019-11-22 09:35:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-22 09:35:07,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:07,347 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:07,348 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash 337207879, now seen corresponding path program 1 times [2019-11-22 09:35:07,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:07,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236115236] [2019-11-22 09:35:07,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:07,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236115236] [2019-11-22 09:35:07,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:07,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 09:35:07,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336526531] [2019-11-22 09:35:07,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 09:35:07,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:07,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 09:35:07,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 09:35:07,462 INFO L87 Difference]: Start difference. First operand 13517 states and 52896 transitions. Second operand 8 states. [2019-11-22 09:35:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:07,816 INFO L93 Difference]: Finished difference Result 22637 states and 85048 transitions. [2019-11-22 09:35:07,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 09:35:07,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-22 09:35:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:07,878 INFO L225 Difference]: With dead ends: 22637 [2019-11-22 09:35:07,879 INFO L226 Difference]: Without dead ends: 16787 [2019-11-22 09:35:07,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-22 09:35:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16787 states. [2019-11-22 09:35:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 12107. [2019-11-22 09:35:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-22 09:35:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 45415 transitions. [2019-11-22 09:35:08,270 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 45415 transitions. Word has length 48 [2019-11-22 09:35:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:08,270 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 45415 transitions. [2019-11-22 09:35:08,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 09:35:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 45415 transitions. [2019-11-22 09:35:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 09:35:08,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:08,286 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:08,287 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -297898423, now seen corresponding path program 1 times [2019-11-22 09:35:08,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:08,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682992298] [2019-11-22 09:35:08,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:08,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682992298] [2019-11-22 09:35:08,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095398864] [2019-11-22 09:35:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:08,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 09:35:08,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:35:08,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:35:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:35:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-22 09:35:08,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290289168] [2019-11-22 09:35:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 09:35:08,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 09:35:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-22 09:35:08,632 INFO L87 Difference]: Start difference. First operand 12107 states and 45415 transitions. Second operand 18 states. [2019-11-22 09:35:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:09,438 INFO L93 Difference]: Finished difference Result 22447 states and 81039 transitions. [2019-11-22 09:35:09,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:09,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-22 09:35:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:09,500 INFO L225 Difference]: With dead ends: 22447 [2019-11-22 09:35:09,500 INFO L226 Difference]: Without dead ends: 19931 [2019-11-22 09:35:09,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2019-11-22 09:35:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2019-11-22 09:35:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 12075. [2019-11-22 09:35:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12075 states. [2019-11-22 09:35:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 44995 transitions. [2019-11-22 09:35:10,543 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 44995 transitions. Word has length 52 [2019-11-22 09:35:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:10,543 INFO L462 AbstractCegarLoop]: Abstraction has 12075 states and 44995 transitions. [2019-11-22 09:35:10,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 09:35:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 44995 transitions. [2019-11-22 09:35:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 09:35:10,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:10,562 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:10,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:10,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2054262665, now seen corresponding path program 2 times [2019-11-22 09:35:10,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:10,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855202593] [2019-11-22 09:35:10,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:10,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855202593] [2019-11-22 09:35:10,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:10,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 09:35:10,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627098271] [2019-11-22 09:35:10,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:35:10,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:10,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:35:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:35:10,866 INFO L87 Difference]: Start difference. First operand 12075 states and 44995 transitions. Second operand 10 states. [2019-11-22 09:35:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:11,286 INFO L93 Difference]: Finished difference Result 20531 states and 73675 transitions. [2019-11-22 09:35:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:11,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 09:35:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:11,319 INFO L225 Difference]: With dead ends: 20531 [2019-11-22 09:35:11,319 INFO L226 Difference]: Without dead ends: 17621 [2019-11-22 09:35:11,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-11-22 09:35:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-11-22 09:35:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 9225. [2019-11-22 09:35:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2019-11-22 09:35:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 34430 transitions. [2019-11-22 09:35:11,577 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 34430 transitions. Word has length 52 [2019-11-22 09:35:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:11,578 INFO L462 AbstractCegarLoop]: Abstraction has 9225 states and 34430 transitions. [2019-11-22 09:35:11,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:35:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 34430 transitions. [2019-11-22 09:35:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 09:35:11,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:11,588 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:11,589 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 795640873, now seen corresponding path program 1 times [2019-11-22 09:35:11,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:11,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981091763] [2019-11-22 09:35:11,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:11,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981091763] [2019-11-22 09:35:11,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:11,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 09:35:11,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152028559] [2019-11-22 09:35:11,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:35:11,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:35:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:35:11,690 INFO L87 Difference]: Start difference. First operand 9225 states and 34430 transitions. Second operand 10 states. [2019-11-22 09:35:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:12,074 INFO L93 Difference]: Finished difference Result 16565 states and 59274 transitions. [2019-11-22 09:35:12,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 09:35:12,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 09:35:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:12,105 INFO L225 Difference]: With dead ends: 16565 [2019-11-22 09:35:12,105 INFO L226 Difference]: Without dead ends: 13655 [2019-11-22 09:35:12,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 09:35:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-11-22 09:35:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 9375. [2019-11-22 09:35:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9375 states. [2019-11-22 09:35:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9375 states to 9375 states and 34645 transitions. [2019-11-22 09:35:12,308 INFO L78 Accepts]: Start accepts. Automaton has 9375 states and 34645 transitions. Word has length 52 [2019-11-22 09:35:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:12,308 INFO L462 AbstractCegarLoop]: Abstraction has 9375 states and 34645 transitions. [2019-11-22 09:35:12,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:35:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9375 states and 34645 transitions. [2019-11-22 09:35:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 09:35:12,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:12,317 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:12,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:12,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash 844196999, now seen corresponding path program 2 times [2019-11-22 09:35:12,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:12,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713361642] [2019-11-22 09:35:12,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:12,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713361642] [2019-11-22 09:35:12,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:12,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 09:35:12,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542480610] [2019-11-22 09:35:12,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 09:35:12,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:12,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 09:35:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-22 09:35:12,416 INFO L87 Difference]: Start difference. First operand 9375 states and 34645 transitions. Second operand 10 states. [2019-11-22 09:35:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:12,843 INFO L93 Difference]: Finished difference Result 14255 states and 50473 transitions. [2019-11-22 09:35:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 09:35:12,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-22 09:35:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:12,871 INFO L225 Difference]: With dead ends: 14255 [2019-11-22 09:35:12,871 INFO L226 Difference]: Without dead ends: 11219 [2019-11-22 09:35:12,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-22 09:35:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-11-22 09:35:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 7203. [2019-11-22 09:35:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-22 09:35:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 26359 transitions. [2019-11-22 09:35:13,073 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 26359 transitions. Word has length 52 [2019-11-22 09:35:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:13,074 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 26359 transitions. [2019-11-22 09:35:13,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 09:35:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 26359 transitions. [2019-11-22 09:35:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:13,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:13,089 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:13,089 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 407355179, now seen corresponding path program 1 times [2019-11-22 09:35:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154897259] [2019-11-22 09:35:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:13,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154897259] [2019-11-22 09:35:13,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408004359] [2019-11-22 09:35:13,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:13,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:35:13,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:35:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:35:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:13,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:35:13,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 09:35:13,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007982692] [2019-11-22 09:35:13,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 09:35:13,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 09:35:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 09:35:13,451 INFO L87 Difference]: Start difference. First operand 7203 states and 26359 transitions. Second operand 22 states. [2019-11-22 09:35:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:14,323 INFO L93 Difference]: Finished difference Result 11819 states and 41675 transitions. [2019-11-22 09:35:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 09:35:14,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 09:35:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:14,341 INFO L225 Difference]: With dead ends: 11819 [2019-11-22 09:35:14,341 INFO L226 Difference]: Without dead ends: 10559 [2019-11-22 09:35:14,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-11-22 09:35:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-11-22 09:35:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 7023. [2019-11-22 09:35:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2019-11-22 09:35:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 25531 transitions. [2019-11-22 09:35:14,873 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 25531 transitions. Word has length 56 [2019-11-22 09:35:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:14,874 INFO L462 AbstractCegarLoop]: Abstraction has 7023 states and 25531 transitions. [2019-11-22 09:35:14,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 09:35:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 25531 transitions. [2019-11-22 09:35:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:14,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:14,883 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:15,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:15,084 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 455911305, now seen corresponding path program 2 times [2019-11-22 09:35:15,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:15,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842735157] [2019-11-22 09:35:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:15,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842735157] [2019-11-22 09:35:15,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153814259] [2019-11-22 09:35:15,208 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:15,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 09:35:15,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 09:35:15,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 09:35:15,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 09:35:15,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 09:35:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 09:35:15,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 09:35:15,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 09:35:15,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332843721] [2019-11-22 09:35:15,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 09:35:15,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:15,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 09:35:15,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-22 09:35:15,470 INFO L87 Difference]: Start difference. First operand 7023 states and 25531 transitions. Second operand 22 states. [2019-11-22 09:35:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:16,225 INFO L93 Difference]: Finished difference Result 10319 states and 36435 transitions. [2019-11-22 09:35:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 09:35:16,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-22 09:35:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:16,240 INFO L225 Difference]: With dead ends: 10319 [2019-11-22 09:35:16,240 INFO L226 Difference]: Without dead ends: 7997 [2019-11-22 09:35:16,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-22 09:35:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2019-11-22 09:35:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 5837. [2019-11-22 09:35:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-22 09:35:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 21036 transitions. [2019-11-22 09:35:16,361 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 21036 transitions. Word has length 56 [2019-11-22 09:35:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:16,361 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 21036 transitions. [2019-11-22 09:35:16,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 09:35:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 21036 transitions. [2019-11-22 09:35:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:16,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:16,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:16,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 09:35:16,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 663240811, now seen corresponding path program 3 times [2019-11-22 09:35:16,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35838045] [2019-11-22 09:35:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:16,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35838045] [2019-11-22 09:35:16,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:16,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 09:35:16,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081813823] [2019-11-22 09:35:16,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 09:35:16,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 09:35:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:35:16,675 INFO L87 Difference]: Start difference. First operand 5837 states and 21036 transitions. Second operand 12 states. [2019-11-22 09:35:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:17,070 INFO L93 Difference]: Finished difference Result 7757 states and 27388 transitions. [2019-11-22 09:35:17,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:17,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 09:35:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:17,082 INFO L225 Difference]: With dead ends: 7757 [2019-11-22 09:35:17,082 INFO L226 Difference]: Without dead ends: 6497 [2019-11-22 09:35:17,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-22 09:35:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-11-22 09:35:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5177. [2019-11-22 09:35:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2019-11-22 09:35:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 18560 transitions. [2019-11-22 09:35:17,167 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 18560 transitions. Word has length 56 [2019-11-22 09:35:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:17,167 INFO L462 AbstractCegarLoop]: Abstraction has 5177 states and 18560 transitions. [2019-11-22 09:35:17,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 09:35:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 18560 transitions. [2019-11-22 09:35:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:17,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:17,175 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:17,175 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 641585993, now seen corresponding path program 4 times [2019-11-22 09:35:17,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:17,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919182037] [2019-11-22 09:35:17,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:17,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919182037] [2019-11-22 09:35:17,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:17,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 09:35:17,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113895825] [2019-11-22 09:35:17,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 09:35:17,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 09:35:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:35:17,294 INFO L87 Difference]: Start difference. First operand 5177 states and 18560 transitions. Second operand 12 states. [2019-11-22 09:35:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:17,684 INFO L93 Difference]: Finished difference Result 7097 states and 24912 transitions. [2019-11-22 09:35:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-22 09:35:17,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 09:35:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:17,693 INFO L225 Difference]: With dead ends: 7097 [2019-11-22 09:35:17,693 INFO L226 Difference]: Without dead ends: 5027 [2019-11-22 09:35:17,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-11-22 09:35:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2019-11-22 09:35:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4187. [2019-11-22 09:35:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-22 09:35:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 14681 transitions. [2019-11-22 09:35:17,754 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 14681 transitions. Word has length 56 [2019-11-22 09:35:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:17,754 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 14681 transitions. [2019-11-22 09:35:17,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 09:35:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 14681 transitions. [2019-11-22 09:35:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:17,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:17,760 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:17,760 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash 59382823, now seen corresponding path program 5 times [2019-11-22 09:35:17,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:17,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231583775] [2019-11-22 09:35:17,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:17,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231583775] [2019-11-22 09:35:17,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:17,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 09:35:17,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639834162] [2019-11-22 09:35:17,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 09:35:17,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 09:35:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:35:17,919 INFO L87 Difference]: Start difference. First operand 4187 states and 14681 transitions. Second operand 12 states. [2019-11-22 09:35:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:18,226 INFO L93 Difference]: Finished difference Result 4787 states and 16621 transitions. [2019-11-22 09:35:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 09:35:18,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 09:35:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:18,233 INFO L225 Difference]: With dead ends: 4787 [2019-11-22 09:35:18,233 INFO L226 Difference]: Without dead ends: 3527 [2019-11-22 09:35:18,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-11-22 09:35:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-11-22 09:35:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3527. [2019-11-22 09:35:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-11-22 09:35:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 12205 transitions. [2019-11-22 09:35:18,280 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 12205 transitions. Word has length 56 [2019-11-22 09:35:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:18,280 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 12205 transitions. [2019-11-22 09:35:18,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 09:35:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 12205 transitions. [2019-11-22 09:35:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-22 09:35:18,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 09:35:18,285 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 09:35:18,285 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-22 09:35:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 09:35:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1277217831, now seen corresponding path program 6 times [2019-11-22 09:35:18,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 09:35:18,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92604717] [2019-11-22 09:35:18,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 09:35:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 09:35:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 09:35:18,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92604717] [2019-11-22 09:35:18,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 09:35:18,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 09:35:18,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653867447] [2019-11-22 09:35:18,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 09:35:18,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 09:35:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 09:35:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-22 09:35:18,410 INFO L87 Difference]: Start difference. First operand 3527 states and 12205 transitions. Second operand 12 states. [2019-11-22 09:35:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 09:35:18,653 INFO L93 Difference]: Finished difference Result 3287 states and 11381 transitions. [2019-11-22 09:35:18,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 09:35:18,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-22 09:35:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 09:35:18,654 INFO L225 Difference]: With dead ends: 3287 [2019-11-22 09:35:18,655 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 09:35:18,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-22 09:35:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 09:35:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 09:35:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 09:35:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 09:35:18,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-22 09:35:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 09:35:18,659 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 09:35:18,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 09:35:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 09:35:18,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 09:35:18,662 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-22 09:35:18,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:35:18 BasicIcfg [2019-11-22 09:35:18,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 09:35:18,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 09:35:18,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 09:35:18,665 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 09:35:18,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:50" (3/4) ... [2019-11-22 09:35:18,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 09:35:18,675 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2019-11-22 09:35:18,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-22 09:35:18,679 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 09:35:18,680 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 09:35:18,680 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 09:35:18,721 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 09:35:18,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 09:35:18,724 INFO L168 Benchmark]: Toolchain (without parser) took 28876.11 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 961.7 MB in the beginning and 1.4 GB in the end (delta: -428.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-22 09:35:18,725 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:35:18,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-22 09:35:18,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-22 09:35:18,727 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:35:18,727 INFO L168 Benchmark]: RCFGBuilder took 408.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-22 09:35:18,728 INFO L168 Benchmark]: TraceAbstraction took 27718.40 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -302.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-22 09:35:18,728 INFO L168 Benchmark]: Witness Printer took 56.66 ms. Allocated memory is still 3.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 09:35:18,732 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 408.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27718.40 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -302.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 56.66 ms. Allocated memory is still 3.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 675]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 4 error locations. Result: SAFE, OverallTime: 27.5s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2462 SDtfs, 7849 SDslu, 13500 SDs, 0 SdLazy, 3663 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34966occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 86614 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 244626 SizeOfPredicates, 36 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 128/194 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...