./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer --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 32bit --witnessprinter.graph.data.programhash ca0a1e4d7e3711007343b5979fe7978b3c373b5f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:47:09,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:47:09,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:47:09,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:47:09,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:47:09,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:47:09,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:47:09,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:47:09,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:47:09,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:47:09,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:47:09,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:47:09,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:47:09,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:47:09,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:47:09,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:47:09,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:47:09,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:47:09,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:47:09,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:47:09,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:47:09,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:47:09,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:47:09,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:47:09,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:47:09,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:47:09,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:47:09,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:47:09,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:47:09,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:47:09,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:47:09,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:47:09,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:47:09,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:47:09,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:47:09,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:47:09,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:47:09,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:47:09,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:47:09,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:47:09,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:47:09,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:47:09,498 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:47:09,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:47:09,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:47:09,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:47:09,510 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:47:09,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:47:09,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:47:09,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:47:09,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:47:09,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:47:09,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:47:09,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:47:09,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:47:09,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:47:09,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:47:09,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:47:09,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:47:09,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:47:09,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:47:09,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:47:09,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:47:09,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:47:09,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:47:09,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:47:09,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:47:09,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:47:09,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:47:09,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:47:09,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca0a1e4d7e3711007343b5979fe7978b3c373b5f [2019-11-19 21:47:09,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:47:09,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:47:09,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:47:09,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:47:09,715 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:47:09,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2019-11-19 21:47:09,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/data/35b48d972/aaf1fff164674159ba266f5922643652/FLAGf61b3cceb [2019-11-19 21:47:10,363 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:47:10,364 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2019-11-19 21:47:10,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/data/35b48d972/aaf1fff164674159ba266f5922643652/FLAGf61b3cceb [2019-11-19 21:47:10,625 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/data/35b48d972/aaf1fff164674159ba266f5922643652 [2019-11-19 21:47:10,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:47:10,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:47:10,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:10,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:47:10,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:47:10,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:10" (1/1) ... [2019-11-19 21:47:10,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74469f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:10, skipping insertion in model container [2019-11-19 21:47:10,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:10" (1/1) ... [2019-11-19 21:47:10,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:47:10,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:47:11,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:11,350 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:47:11,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:11,486 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:47:11,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11 WrapperNode [2019-11-19 21:47:11,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:11,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:11,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:47:11,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:47:11,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:11,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:47:11,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:47:11,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:47:11,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... [2019-11-19 21:47:11,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:47:11,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:47:11,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:47:11,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:47:11,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/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-19 21:47:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-19 21:47:11,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-19 21:47:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:47:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:47:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:47:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:47:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:47:11,741 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 21:47:11,905 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel [2019-11-19 21:47:11,906 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel [2019-11-19 21:47:11,906 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel#2 [2019-11-19 21:47:11,907 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel#2 [2019-11-19 21:47:12,039 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:47:12,039 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-19 21:47:12,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:12 BoogieIcfgContainer [2019-11-19 21:47:12,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:47:12,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:47:12,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:47:12,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:47:12,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:47:10" (1/3) ... [2019-11-19 21:47:12,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4f8046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:12, skipping insertion in model container [2019-11-19 21:47:12,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:11" (2/3) ... [2019-11-19 21:47:12,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4f8046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:12, skipping insertion in model container [2019-11-19 21:47:12,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:12" (3/3) ... [2019-11-19 21:47:12,047 INFO L109 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2019-11-19 21:47:12,132 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,135 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,136 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,137 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,144 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,144 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_Barrier2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:47:12,206 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 21:47:12,206 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:47:12,213 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 21:47:12,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 21:47:12,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:47:12,257 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:47:12,257 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:47:12,257 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:47:12,257 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:47:12,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:47:12,257 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:47:12,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:47:12,268 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 72 transitions [2019-11-19 21:47:18,449 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44225 states. [2019-11-19 21:47:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 44225 states. [2019-11-19 21:47:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:47:18,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:18,476 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] [2019-11-19 21:47:18,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 113210094, now seen corresponding path program 1 times [2019-11-19 21:47:18,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:18,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240658104] [2019-11-19 21:47:18,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:18,784 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-19 21:47:18,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240658104] [2019-11-19 21:47:18,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:18,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:47:18,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127323286] [2019-11-19 21:47:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:47:18,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:47:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:47:18,807 INFO L87 Difference]: Start difference. First operand 44225 states. Second operand 5 states. [2019-11-19 21:47:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:19,457 INFO L93 Difference]: Finished difference Result 22892 states and 78968 transitions. [2019-11-19 21:47:19,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:47:19,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:47:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:19,671 INFO L225 Difference]: With dead ends: 22892 [2019-11-19 21:47:19,671 INFO L226 Difference]: Without dead ends: 22892 [2019-11-19 21:47:19,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22892 states. [2019-11-19 21:47:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22892 to 15268. [2019-11-19 21:47:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15268 states. [2019-11-19 21:47:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15268 states to 15268 states and 53886 transitions. [2019-11-19 21:47:20,813 INFO L78 Accepts]: Start accepts. Automaton has 15268 states and 53886 transitions. Word has length 22 [2019-11-19 21:47:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:20,813 INFO L462 AbstractCegarLoop]: Abstraction has 15268 states and 53886 transitions. [2019-11-19 21:47:20,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:47:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15268 states and 53886 transitions. [2019-11-19 21:47:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:47:20,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:20,818 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] [2019-11-19 21:47:20,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 114164367, now seen corresponding path program 1 times [2019-11-19 21:47:20,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:20,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921838159] [2019-11-19 21:47:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:20,934 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-19 21:47:20,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921838159] [2019-11-19 21:47:20,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:20,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:47:20,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582158908] [2019-11-19 21:47:20,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:47:20,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:47:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:47:20,940 INFO L87 Difference]: Start difference. First operand 15268 states and 53886 transitions. Second operand 3 states. [2019-11-19 21:47:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:21,171 INFO L93 Difference]: Finished difference Result 15200 states and 51277 transitions. [2019-11-19 21:47:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:47:21,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 21:47:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:21,227 INFO L225 Difference]: With dead ends: 15200 [2019-11-19 21:47:21,228 INFO L226 Difference]: Without dead ends: 15088 [2019-11-19 21:47:21,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:47:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15088 states. [2019-11-19 21:47:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15088 to 14476. [2019-11-19 21:47:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14476 states. [2019-11-19 21:47:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14476 states to 14476 states and 49010 transitions. [2019-11-19 21:47:21,853 INFO L78 Accepts]: Start accepts. Automaton has 14476 states and 49010 transitions. Word has length 22 [2019-11-19 21:47:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:21,854 INFO L462 AbstractCegarLoop]: Abstraction has 14476 states and 49010 transitions. [2019-11-19 21:47:21,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:47:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 14476 states and 49010 transitions. [2019-11-19 21:47:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:47:21,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:21,856 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] [2019-11-19 21:47:21,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:21,857 INFO L82 PathProgramCache]: Analyzing trace with hash 877125711, now seen corresponding path program 1 times [2019-11-19 21:47:21,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:21,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952132942] [2019-11-19 21:47:21,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:21,987 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-19 21:47:21,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952132942] [2019-11-19 21:47:21,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:21,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:47:21,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29051633] [2019-11-19 21:47:21,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:47:21,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:47:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:47:21,992 INFO L87 Difference]: Start difference. First operand 14476 states and 49010 transitions. Second operand 5 states. [2019-11-19 21:47:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:22,391 INFO L93 Difference]: Finished difference Result 20800 states and 69105 transitions. [2019-11-19 21:47:22,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:47:22,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:47:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:22,467 INFO L225 Difference]: With dead ends: 20800 [2019-11-19 21:47:22,467 INFO L226 Difference]: Without dead ends: 20624 [2019-11-19 21:47:22,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20624 states. [2019-11-19 21:47:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20624 to 14916. [2019-11-19 21:47:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14916 states. [2019-11-19 21:47:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14916 states to 14916 states and 50241 transitions. [2019-11-19 21:47:23,400 INFO L78 Accepts]: Start accepts. Automaton has 14916 states and 50241 transitions. Word has length 22 [2019-11-19 21:47:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:23,401 INFO L462 AbstractCegarLoop]: Abstraction has 14916 states and 50241 transitions. [2019-11-19 21:47:23,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:47:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14916 states and 50241 transitions. [2019-11-19 21:47:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:47:23,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:23,403 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] [2019-11-19 21:47:23,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1641041328, now seen corresponding path program 1 times [2019-11-19 21:47:23,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:23,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513777591] [2019-11-19 21:47:23,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:23,498 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-19 21:47:23,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513777591] [2019-11-19 21:47:23,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:23,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:47:23,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017281276] [2019-11-19 21:47:23,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:47:23,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:47:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:47:23,500 INFO L87 Difference]: Start difference. First operand 14916 states and 50241 transitions. Second operand 5 states. [2019-11-19 21:47:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:23,694 INFO L93 Difference]: Finished difference Result 19068 states and 63273 transitions. [2019-11-19 21:47:23,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:47:23,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:47:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:23,748 INFO L225 Difference]: With dead ends: 19068 [2019-11-19 21:47:23,749 INFO L226 Difference]: Without dead ends: 18828 [2019-11-19 21:47:23,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18828 states. [2019-11-19 21:47:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18828 to 13336. [2019-11-19 21:47:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13336 states. [2019-11-19 21:47:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 44876 transitions. [2019-11-19 21:47:24,251 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 44876 transitions. Word has length 22 [2019-11-19 21:47:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:24,252 INFO L462 AbstractCegarLoop]: Abstraction has 13336 states and 44876 transitions. [2019-11-19 21:47:24,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:47:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 44876 transitions. [2019-11-19 21:47:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:24,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:24,258 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] [2019-11-19 21:47:24,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1194219540, now seen corresponding path program 1 times [2019-11-19 21:47:24,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:24,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250650406] [2019-11-19 21:47:24,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:24,351 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-19 21:47:24,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250650406] [2019-11-19 21:47:24,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:24,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:24,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743870304] [2019-11-19 21:47:24,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:24,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:24,353 INFO L87 Difference]: Start difference. First operand 13336 states and 44876 transitions. Second operand 7 states. [2019-11-19 21:47:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:24,820 INFO L93 Difference]: Finished difference Result 21388 states and 70714 transitions. [2019-11-19 21:47:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:24,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:24,886 INFO L225 Difference]: With dead ends: 21388 [2019-11-19 21:47:24,886 INFO L226 Difference]: Without dead ends: 21024 [2019-11-19 21:47:24,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21024 states. [2019-11-19 21:47:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21024 to 13264. [2019-11-19 21:47:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13264 states. [2019-11-19 21:47:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13264 states to 13264 states and 44579 transitions. [2019-11-19 21:47:25,387 INFO L78 Accepts]: Start accepts. Automaton has 13264 states and 44579 transitions. Word has length 30 [2019-11-19 21:47:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:25,388 INFO L462 AbstractCegarLoop]: Abstraction has 13264 states and 44579 transitions. [2019-11-19 21:47:25,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13264 states and 44579 transitions. [2019-11-19 21:47:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:25,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:25,404 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] [2019-11-19 21:47:25,405 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1230616910, now seen corresponding path program 1 times [2019-11-19 21:47:25,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:25,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795944599] [2019-11-19 21:47:25,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:25,543 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-19 21:47:25,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795944599] [2019-11-19 21:47:25,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:25,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:25,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568672004] [2019-11-19 21:47:25,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:25,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:25,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:25,545 INFO L87 Difference]: Start difference. First operand 13264 states and 44579 transitions. Second operand 7 states. [2019-11-19 21:47:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:26,406 INFO L93 Difference]: Finished difference Result 19608 states and 64688 transitions. [2019-11-19 21:47:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:26,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:26,449 INFO L225 Difference]: With dead ends: 19608 [2019-11-19 21:47:26,449 INFO L226 Difference]: Without dead ends: 19244 [2019-11-19 21:47:26,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2019-11-19 21:47:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 11024. [2019-11-19 21:47:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11024 states. [2019-11-19 21:47:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 36990 transitions. [2019-11-19 21:47:26,870 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 36990 transitions. Word has length 30 [2019-11-19 21:47:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:26,872 INFO L462 AbstractCegarLoop]: Abstraction has 11024 states and 36990 transitions. [2019-11-19 21:47:26,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 36990 transitions. [2019-11-19 21:47:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:26,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:26,880 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] [2019-11-19 21:47:26,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1859449811, now seen corresponding path program 1 times [2019-11-19 21:47:26,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:26,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908439064] [2019-11-19 21:47:26,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:26,976 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-19 21:47:26,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908439064] [2019-11-19 21:47:26,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:26,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:26,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753608748] [2019-11-19 21:47:26,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:26,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:26,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:26,977 INFO L87 Difference]: Start difference. First operand 11024 states and 36990 transitions. Second operand 7 states. [2019-11-19 21:47:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:27,470 INFO L93 Difference]: Finished difference Result 16916 states and 56000 transitions. [2019-11-19 21:47:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:27,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:27,504 INFO L225 Difference]: With dead ends: 16916 [2019-11-19 21:47:27,505 INFO L226 Difference]: Without dead ends: 16440 [2019-11-19 21:47:27,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16440 states. [2019-11-19 21:47:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16440 to 10728. [2019-11-19 21:47:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10728 states. [2019-11-19 21:47:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10728 states to 10728 states and 36077 transitions. [2019-11-19 21:47:27,850 INFO L78 Accepts]: Start accepts. Automaton has 10728 states and 36077 transitions. Word has length 30 [2019-11-19 21:47:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:27,851 INFO L462 AbstractCegarLoop]: Abstraction has 10728 states and 36077 transitions. [2019-11-19 21:47:27,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10728 states and 36077 transitions. [2019-11-19 21:47:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:27,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:27,856 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] [2019-11-19 21:47:27,856 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash 505215443, now seen corresponding path program 1 times [2019-11-19 21:47:27,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:27,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472613596] [2019-11-19 21:47:27,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:27,965 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-19 21:47:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472613596] [2019-11-19 21:47:27,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:27,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:27,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632579089] [2019-11-19 21:47:27,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:27,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:27,967 INFO L87 Difference]: Start difference. First operand 10728 states and 36077 transitions. Second operand 7 states. [2019-11-19 21:47:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:28,358 INFO L93 Difference]: Finished difference Result 13552 states and 44504 transitions. [2019-11-19 21:47:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:28,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:28,386 INFO L225 Difference]: With dead ends: 13552 [2019-11-19 21:47:28,386 INFO L226 Difference]: Without dead ends: 13188 [2019-11-19 21:47:28,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13188 states. [2019-11-19 21:47:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13188 to 8180. [2019-11-19 21:47:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2019-11-19 21:47:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 27272 transitions. [2019-11-19 21:47:28,630 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 27272 transitions. Word has length 30 [2019-11-19 21:47:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:28,630 INFO L462 AbstractCegarLoop]: Abstraction has 8180 states and 27272 transitions. [2019-11-19 21:47:28,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 27272 transitions. [2019-11-19 21:47:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:28,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:28,635 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] [2019-11-19 21:47:28,636 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1560897416, now seen corresponding path program 1 times [2019-11-19 21:47:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:28,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320021963] [2019-11-19 21:47:28,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:28,716 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-19 21:47:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320021963] [2019-11-19 21:47:28,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:28,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:28,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609341934] [2019-11-19 21:47:28,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:28,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:28,718 INFO L87 Difference]: Start difference. First operand 8180 states and 27272 transitions. Second operand 7 states. [2019-11-19 21:47:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:29,044 INFO L93 Difference]: Finished difference Result 11208 states and 36891 transitions. [2019-11-19 21:47:29,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:29,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:29,061 INFO L225 Difference]: With dead ends: 11208 [2019-11-19 21:47:29,061 INFO L226 Difference]: Without dead ends: 10732 [2019-11-19 21:47:29,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10732 states. [2019-11-19 21:47:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10732 to 8264. [2019-11-19 21:47:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-11-19 21:47:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 27511 transitions. [2019-11-19 21:47:29,292 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 27511 transitions. Word has length 30 [2019-11-19 21:47:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:29,293 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 27511 transitions. [2019-11-19 21:47:29,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 27511 transitions. [2019-11-19 21:47:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:47:29,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:29,298 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] [2019-11-19 21:47:29,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1750408268, now seen corresponding path program 1 times [2019-11-19 21:47:29,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:29,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890932845] [2019-11-19 21:47:29,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:29,453 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-19 21:47:29,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890932845] [2019-11-19 21:47:29,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:29,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 21:47:29,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409177106] [2019-11-19 21:47:29,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:47:29,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:47:29,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:47:29,455 INFO L87 Difference]: Start difference. First operand 8264 states and 27511 transitions. Second operand 7 states. [2019-11-19 21:47:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:29,840 INFO L93 Difference]: Finished difference Result 6768 states and 21839 transitions. [2019-11-19 21:47:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:47:29,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 21:47:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:29,853 INFO L225 Difference]: With dead ends: 6768 [2019-11-19 21:47:29,854 INFO L226 Difference]: Without dead ends: 6292 [2019-11-19 21:47:29,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:47:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2019-11-19 21:47:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 5068. [2019-11-19 21:47:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5068 states. [2019-11-19 21:47:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 16364 transitions. [2019-11-19 21:47:30,001 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 16364 transitions. Word has length 30 [2019-11-19 21:47:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:30,001 INFO L462 AbstractCegarLoop]: Abstraction has 5068 states and 16364 transitions. [2019-11-19 21:47:30,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:47:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 16364 transitions. [2019-11-19 21:47:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:47:30,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:30,007 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-19 21:47:30,007 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -677210563, now seen corresponding path program 1 times [2019-11-19 21:47:30,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:30,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909045417] [2019-11-19 21:47:30,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 21:47:30,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909045417] [2019-11-19 21:47:30,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:30,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:47:30,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791647617] [2019-11-19 21:47:30,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:47:30,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:30,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:47:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:47:30,057 INFO L87 Difference]: Start difference. First operand 5068 states and 16364 transitions. Second operand 3 states. [2019-11-19 21:47:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:30,112 INFO L93 Difference]: Finished difference Result 1504 states and 3686 transitions. [2019-11-19 21:47:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:47:30,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-19 21:47:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:30,116 INFO L225 Difference]: With dead ends: 1504 [2019-11-19 21:47:30,116 INFO L226 Difference]: Without dead ends: 1504 [2019-11-19 21:47:30,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:47:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-11-19 21:47:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2019-11-19 21:47:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-11-19 21:47:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3686 transitions. [2019-11-19 21:47:30,147 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3686 transitions. Word has length 38 [2019-11-19 21:47:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:30,148 INFO L462 AbstractCegarLoop]: Abstraction has 1504 states and 3686 transitions. [2019-11-19 21:47:30,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:47:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3686 transitions. [2019-11-19 21:47:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:47:30,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:30,151 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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-19 21:47:30,151 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash -9381801, now seen corresponding path program 1 times [2019-11-19 21:47:30,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:30,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997642790] [2019-11-19 21:47:30,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:47:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:47:30,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:47:30,248 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:47:30,316 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 21:47:30,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:47:30 BasicIcfg [2019-11-19 21:47:30,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:47:30,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:47:30,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:47:30,319 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:47:30,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:12" (3/4) ... [2019-11-19 21:47:30,322 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:47:30,503 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8bf5e862-6086-47e1-a4be-3c058c68507e/bin/uautomizer/witness.graphml [2019-11-19 21:47:30,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:47:30,509 INFO L168 Benchmark]: Toolchain (without parser) took 19879.22 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.8 MB in the beginning and 720.0 MB in the end (delta: 224.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-19 21:47:30,510 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:47:30,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:30,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.54 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-19 21:47:30,511 INFO L168 Benchmark]: Boogie Preprocessor took 48.47 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-19 21:47:30,511 INFO L168 Benchmark]: RCFGBuilder took 442.11 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:30,512 INFO L168 Benchmark]: TraceAbstraction took 18276.76 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 727.9 MB in the end (delta: 374.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-19 21:47:30,512 INFO L168 Benchmark]: Witness Printer took 188.19 ms. Allocated memory is still 2.2 GB. Free memory was 727.9 MB in the beginning and 720.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:30,514 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 851.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.54 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. * Boogie Preprocessor took 48.47 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 442.11 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18276.76 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 727.9 MB in the end (delta: 374.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 188.19 ms. Allocated memory is still 2.2 GB. Free memory was 727.9 MB in the beginning and 720.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L674] 0 volatile unsigned int count = 0; VAL [count=0] [L675] 0 _Bool MTX = 0; VAL [count=0, MTX=0] [L676] 0 _Bool COND = 0; VAL [COND=0, count=0, MTX=0] [L702] 0 pthread_t t; VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L703] COND TRUE 0 1 VAL [COND=0, count=0, MTX=0] [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, count=0, MTX=0] [L688] CALL 1 __VERIFIER_atomic_acquire() [L680] 1 MTX = 1 [L688] RET 1 __VERIFIER_atomic_acquire() [L689] 1 count++ VAL [COND=0, count=1, MTX=1] [L690] COND FALSE 1 !(count == 3) [L694] CALL 1 __VERIFIER_atomic_release() [L685] 1 MTX = 0 [L694] RET 1 __VERIFIER_atomic_release() [L688] CALL 3 __VERIFIER_atomic_acquire() [L680] 3 MTX = 1 [L688] RET 3 __VERIFIER_atomic_acquire() [L689] 3 count++ VAL [COND=0, count=2, MTX=1] [L690] COND FALSE 3 !(count == 3) [L694] CALL 3 __VERIFIER_atomic_release() [L685] 3 MTX = 0 [L694] RET 3 __VERIFIER_atomic_release() [L688] CALL 2 __VERIFIER_atomic_acquire() [L680] 2 MTX = 1 [L688] RET 2 __VERIFIER_atomic_acquire() [L689] 2 count++ VAL [COND=0, count=3, MTX=1] [L690] COND TRUE 2 count == 3 VAL [COND=0, count=3, MTX=1] [L691] 2 COND = 1 VAL [COND=1, count=3, MTX=1] [L692] 2 count = 0 VAL [COND=1, count=0, MTX=1] [L695] CALL 2 __VERIFIER_atomic_release() [L685] 2 MTX = 0 [L695] RET 2 __VERIFIER_atomic_release() [L698] 2 __VERIFIER_error() VAL [COND=1, count=0, MTX=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 82 locations, 4 error locations. Result: UNSAFE, OverallTime: 18.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1475 SDtfs, 2524 SDslu, 3295 SDs, 0 SdLazy, 1193 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44225occurred 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: 5.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 49828 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 23203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 28/28 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 incorrect! Received shutdown request...