/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:17:45,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:17:45,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:17:45,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:17:45,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:17:45,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:17:45,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:17:45,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:17:45,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:17:45,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:17:45,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:17:45,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:17:45,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:17:45,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:17:45,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:17:45,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:17:45,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:17:45,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:17:45,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:17:45,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:17:45,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:17:45,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:17:45,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:17:45,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:17:45,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:17:45,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:17:45,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:17:45,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:17:45,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:17:45,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:17:45,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:17:45,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:17:45,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:17:45,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:17:45,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:17:45,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:17:45,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:17:45,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:17:45,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:17:45,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:17:45,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:17:45,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:17:45,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:17:45,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:17:45,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:17:45,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:17:45,638 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:17:45,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:17:45,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:17:45,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:17:45,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:17:45,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:17:45,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:17:45,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:17:45,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:17:45,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:17:45,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:17:45,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:17:45,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:17:45,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:17:45,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:17:45,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:17:45,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:17:45,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:17:45,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:17:45,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:17:45,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:17:45,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:17:45,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:17:45,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:17:45,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:17:45,929 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:17:45,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-18 22:17:46,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ece3e64/341465ab3ab3466aaa155fe91b28b416/FLAG8b4453d71 [2019-12-18 22:17:46,630 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:17:46,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.oepc.i [2019-12-18 22:17:46,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ece3e64/341465ab3ab3466aaa155fe91b28b416/FLAG8b4453d71 [2019-12-18 22:17:46,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ece3e64/341465ab3ab3466aaa155fe91b28b416 [2019-12-18 22:17:46,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:17:46,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:17:46,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:17:46,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:17:46,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:17:46,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:17:46" (1/1) ... [2019-12-18 22:17:46,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b75db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:46, skipping insertion in model container [2019-12-18 22:17:46,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:17:46" (1/1) ... [2019-12-18 22:17:46,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:17:46,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:17:47,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:17:47,544 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:17:47,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:17:47,687 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:17:47,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47 WrapperNode [2019-12-18 22:17:47,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:17:47,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:17:47,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:17:47,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:17:47,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:17:47,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:17:47,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:17:47,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:17:47,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (1/1) ... [2019-12-18 22:17:47,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:17:47,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:17:47,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:17:47,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:17:47,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (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-12-18 22:17:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:17:47,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:17:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:17:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:17:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:17:47,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:17:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:17:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:17:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:17:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:17:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:17:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:17:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:17:47,877 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:17:48,656 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:17:48,656 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:17:48,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:17:48 BoogieIcfgContainer [2019-12-18 22:17:48,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:17:48,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:17:48,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:17:48,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:17:48,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:17:46" (1/3) ... [2019-12-18 22:17:48,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55150e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:17:48, skipping insertion in model container [2019-12-18 22:17:48,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:17:47" (2/3) ... [2019-12-18 22:17:48,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55150e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:17:48, skipping insertion in model container [2019-12-18 22:17:48,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:17:48" (3/3) ... [2019-12-18 22:17:48,671 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.oepc.i [2019-12-18 22:17:48,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:17:48,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:17:48,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:17:48,696 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:17:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,749 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,832 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:17:48,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:17:48,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:17:48,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:17:48,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:17:48,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:17:48,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:17:48,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:17:48,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:17:48,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:17:48,895 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:17:48,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:17:48,980 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:17:48,980 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:17:48,998 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:17:49,024 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:17:49,067 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:17:49,067 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:17:49,075 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:17:49,095 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:17:49,096 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:17:52,326 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-18 22:17:52,974 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:17:53,109 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75395 [2019-12-18 22:17:53,109 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 22:17:53,114 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 22:18:07,442 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89162 states. [2019-12-18 22:18:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 89162 states. [2019-12-18 22:18:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:18:07,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:07,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:18:07,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash 795562218, now seen corresponding path program 1 times [2019-12-18 22:18:07,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:07,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950211657] [2019-12-18 22:18:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:07,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950211657] [2019-12-18 22:18:07,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:07,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:18:07,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007499741] [2019-12-18 22:18:07,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:07,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:07,703 INFO L87 Difference]: Start difference. First operand 89162 states. Second operand 3 states. [2019-12-18 22:18:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:10,641 INFO L93 Difference]: Finished difference Result 87552 states and 377777 transitions. [2019-12-18 22:18:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:10,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:18:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:11,252 INFO L225 Difference]: With dead ends: 87552 [2019-12-18 22:18:11,253 INFO L226 Difference]: Without dead ends: 82092 [2019-12-18 22:18:11,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 22:18:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82092 states. [2019-12-18 22:18:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82092 to 82092. [2019-12-18 22:18:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82092 states. [2019-12-18 22:18:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82092 states to 82092 states and 353697 transitions. [2019-12-18 22:18:16,947 INFO L78 Accepts]: Start accepts. Automaton has 82092 states and 353697 transitions. Word has length 5 [2019-12-18 22:18:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:16,948 INFO L462 AbstractCegarLoop]: Abstraction has 82092 states and 353697 transitions. [2019-12-18 22:18:16,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 82092 states and 353697 transitions. [2019-12-18 22:18:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:18:16,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:16,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:16,957 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1486977711, now seen corresponding path program 1 times [2019-12-18 22:18:16,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:16,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165107939] [2019-12-18 22:18:16,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:17,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165107939] [2019-12-18 22:18:17,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:17,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:17,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328485990] [2019-12-18 22:18:17,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:17,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:17,043 INFO L87 Difference]: Start difference. First operand 82092 states and 353697 transitions. Second operand 3 states. [2019-12-18 22:18:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:17,221 INFO L93 Difference]: Finished difference Result 21487 states and 74397 transitions. [2019-12-18 22:18:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:17,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:18:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:17,302 INFO L225 Difference]: With dead ends: 21487 [2019-12-18 22:18:17,303 INFO L226 Difference]: Without dead ends: 21487 [2019-12-18 22:18:17,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-18 22:18:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-12-18 22:18:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21487. [2019-12-18 22:18:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-12-18 22:18:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 74397 transitions. [2019-12-18 22:18:20,889 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 74397 transitions. Word has length 13 [2019-12-18 22:18:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:20,889 INFO L462 AbstractCegarLoop]: Abstraction has 21487 states and 74397 transitions. [2019-12-18 22:18:20,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 74397 transitions. [2019-12-18 22:18:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:18:20,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:20,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:20,892 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash -726251993, now seen corresponding path program 1 times [2019-12-18 22:18:20,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:20,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562212634] [2019-12-18 22:18:20,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:21,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562212634] [2019-12-18 22:18:21,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:21,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:21,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718415552] [2019-12-18 22:18:21,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:21,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:21,019 INFO L87 Difference]: Start difference. First operand 21487 states and 74397 transitions. Second operand 4 states. [2019-12-18 22:18:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:21,392 INFO L93 Difference]: Finished difference Result 31642 states and 105483 transitions. [2019-12-18 22:18:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:18:21,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:18:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:21,489 INFO L225 Difference]: With dead ends: 31642 [2019-12-18 22:18:21,489 INFO L226 Difference]: Without dead ends: 31628 [2019-12-18 22:18:21,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2019-12-18 22:18:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 28614. [2019-12-18 22:18:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28614 states. [2019-12-18 22:18:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28614 states to 28614 states and 96383 transitions. [2019-12-18 22:18:22,636 INFO L78 Accepts]: Start accepts. Automaton has 28614 states and 96383 transitions. Word has length 13 [2019-12-18 22:18:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:22,637 INFO L462 AbstractCegarLoop]: Abstraction has 28614 states and 96383 transitions. [2019-12-18 22:18:22,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28614 states and 96383 transitions. [2019-12-18 22:18:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:18:22,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:22,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:22,639 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:22,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1448024626, now seen corresponding path program 1 times [2019-12-18 22:18:22,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:22,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944770573] [2019-12-18 22:18:22,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:22,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944770573] [2019-12-18 22:18:22,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:22,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:22,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653654906] [2019-12-18 22:18:22,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:18:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:18:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:22,743 INFO L87 Difference]: Start difference. First operand 28614 states and 96383 transitions. Second operand 5 states. [2019-12-18 22:18:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:23,251 INFO L93 Difference]: Finished difference Result 41448 states and 137006 transitions. [2019-12-18 22:18:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:18:23,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:18:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:23,373 INFO L225 Difference]: With dead ends: 41448 [2019-12-18 22:18:23,373 INFO L226 Difference]: Without dead ends: 41430 [2019-12-18 22:18:23,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41430 states. [2019-12-18 22:18:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41430 to 32619. [2019-12-18 22:18:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32619 states. [2019-12-18 22:18:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32619 states to 32619 states and 109205 transitions. [2019-12-18 22:18:24,359 INFO L78 Accepts]: Start accepts. Automaton has 32619 states and 109205 transitions. Word has length 14 [2019-12-18 22:18:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:24,360 INFO L462 AbstractCegarLoop]: Abstraction has 32619 states and 109205 transitions. [2019-12-18 22:18:24,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:18:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32619 states and 109205 transitions. [2019-12-18 22:18:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:18:24,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:24,371 INFO L411 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-12-18 22:18:24,371 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash -84735485, now seen corresponding path program 1 times [2019-12-18 22:18:24,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:24,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938602056] [2019-12-18 22:18:24,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:24,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938602056] [2019-12-18 22:18:24,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:24,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:18:24,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022436318] [2019-12-18 22:18:24,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:18:24,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:24,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:18:24,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:18:24,465 INFO L87 Difference]: Start difference. First operand 32619 states and 109205 transitions. Second operand 6 states. [2019-12-18 22:18:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:25,493 INFO L93 Difference]: Finished difference Result 56365 states and 183236 transitions. [2019-12-18 22:18:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:25,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:18:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:25,640 INFO L225 Difference]: With dead ends: 56365 [2019-12-18 22:18:25,640 INFO L226 Difference]: Without dead ends: 56335 [2019-12-18 22:18:25,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56335 states. [2019-12-18 22:18:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56335 to 37720. [2019-12-18 22:18:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37720 states. [2019-12-18 22:18:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37720 states to 37720 states and 124779 transitions. [2019-12-18 22:18:26,570 INFO L78 Accepts]: Start accepts. Automaton has 37720 states and 124779 transitions. Word has length 22 [2019-12-18 22:18:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:26,570 INFO L462 AbstractCegarLoop]: Abstraction has 37720 states and 124779 transitions. [2019-12-18 22:18:26,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:18:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37720 states and 124779 transitions. [2019-12-18 22:18:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:18:26,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:26,580 INFO L411 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-12-18 22:18:26,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1487058349, now seen corresponding path program 2 times [2019-12-18 22:18:26,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131296776] [2019-12-18 22:18:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:26,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131296776] [2019-12-18 22:18:26,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:26,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:18:26,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696808393] [2019-12-18 22:18:26,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:26,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:26,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:26,762 INFO L87 Difference]: Start difference. First operand 37720 states and 124779 transitions. Second operand 7 states. [2019-12-18 22:18:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:28,081 INFO L93 Difference]: Finished difference Result 56547 states and 183575 transitions. [2019-12-18 22:18:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:18:28,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 22:18:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:28,254 INFO L225 Difference]: With dead ends: 56547 [2019-12-18 22:18:28,255 INFO L226 Difference]: Without dead ends: 56505 [2019-12-18 22:18:28,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:18:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56505 states. [2019-12-18 22:18:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56505 to 32874. [2019-12-18 22:18:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32874 states. [2019-12-18 22:18:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32874 states to 32874 states and 109363 transitions. [2019-12-18 22:18:29,186 INFO L78 Accepts]: Start accepts. Automaton has 32874 states and 109363 transitions. Word has length 22 [2019-12-18 22:18:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:29,186 INFO L462 AbstractCegarLoop]: Abstraction has 32874 states and 109363 transitions. [2019-12-18 22:18:29,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32874 states and 109363 transitions. [2019-12-18 22:18:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:18:29,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:29,198 INFO L411 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-12-18 22:18:29,198 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1211743988, now seen corresponding path program 1 times [2019-12-18 22:18:29,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827805222] [2019-12-18 22:18:29,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:29,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827805222] [2019-12-18 22:18:29,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:29,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:29,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738317312] [2019-12-18 22:18:29,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:29,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:29,255 INFO L87 Difference]: Start difference. First operand 32874 states and 109363 transitions. Second operand 4 states. [2019-12-18 22:18:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:29,325 INFO L93 Difference]: Finished difference Result 12715 states and 39293 transitions. [2019-12-18 22:18:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:18:29,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:18:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:29,343 INFO L225 Difference]: With dead ends: 12715 [2019-12-18 22:18:29,343 INFO L226 Difference]: Without dead ends: 12715 [2019-12-18 22:18:29,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-18 22:18:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 12619. [2019-12-18 22:18:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12619 states. [2019-12-18 22:18:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12619 states to 12619 states and 39013 transitions. [2019-12-18 22:18:29,534 INFO L78 Accepts]: Start accepts. Automaton has 12619 states and 39013 transitions. Word has length 25 [2019-12-18 22:18:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:29,535 INFO L462 AbstractCegarLoop]: Abstraction has 12619 states and 39013 transitions. [2019-12-18 22:18:29,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12619 states and 39013 transitions. [2019-12-18 22:18:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:18:29,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:29,867 INFO L411 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, 1, 1, 1, 1, 1] [2019-12-18 22:18:29,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash 261453908, now seen corresponding path program 1 times [2019-12-18 22:18:29,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:29,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333427044] [2019-12-18 22:18:29,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:29,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333427044] [2019-12-18 22:18:29,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:29,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:18:29,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089701138] [2019-12-18 22:18:29,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:29,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:29,962 INFO L87 Difference]: Start difference. First operand 12619 states and 39013 transitions. Second operand 3 states. [2019-12-18 22:18:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:30,012 INFO L93 Difference]: Finished difference Result 12618 states and 39011 transitions. [2019-12-18 22:18:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:30,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:18:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:30,031 INFO L225 Difference]: With dead ends: 12618 [2019-12-18 22:18:30,031 INFO L226 Difference]: Without dead ends: 12618 [2019-12-18 22:18:30,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 22:18:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2019-12-18 22:18:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12618. [2019-12-18 22:18:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12618 states. [2019-12-18 22:18:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 39011 transitions. [2019-12-18 22:18:30,221 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 39011 transitions. Word has length 39 [2019-12-18 22:18:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:30,221 INFO L462 AbstractCegarLoop]: Abstraction has 12618 states and 39011 transitions. [2019-12-18 22:18:30,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 39011 transitions. [2019-12-18 22:18:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:18:30,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:30,240 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:30,240 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1879938010, now seen corresponding path program 1 times [2019-12-18 22:18:30,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:30,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693549167] [2019-12-18 22:18:30,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:30,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693549167] [2019-12-18 22:18:30,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:30,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:18:30,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188560186] [2019-12-18 22:18:30,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:18:30,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:18:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:30,307 INFO L87 Difference]: Start difference. First operand 12618 states and 39011 transitions. Second operand 5 states. [2019-12-18 22:18:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:30,368 INFO L93 Difference]: Finished difference Result 11359 states and 35772 transitions. [2019-12-18 22:18:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:18:30,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:18:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:30,395 INFO L225 Difference]: With dead ends: 11359 [2019-12-18 22:18:30,395 INFO L226 Difference]: Without dead ends: 11359 [2019-12-18 22:18:30,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-18 22:18:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 11019. [2019-12-18 22:18:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11019 states. [2019-12-18 22:18:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 34816 transitions. [2019-12-18 22:18:30,568 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 34816 transitions. Word has length 40 [2019-12-18 22:18:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:30,569 INFO L462 AbstractCegarLoop]: Abstraction has 11019 states and 34816 transitions. [2019-12-18 22:18:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:18:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 34816 transitions. [2019-12-18 22:18:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:30,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:30,584 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:30,585 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1466334831, now seen corresponding path program 1 times [2019-12-18 22:18:30,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:30,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750690498] [2019-12-18 22:18:30,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:30,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750690498] [2019-12-18 22:18:30,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:30,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:30,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013886506] [2019-12-18 22:18:30,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:30,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:30,652 INFO L87 Difference]: Start difference. First operand 11019 states and 34816 transitions. Second operand 3 states. [2019-12-18 22:18:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:30,747 INFO L93 Difference]: Finished difference Result 14923 states and 47277 transitions. [2019-12-18 22:18:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:30,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:18:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:30,775 INFO L225 Difference]: With dead ends: 14923 [2019-12-18 22:18:30,775 INFO L226 Difference]: Without dead ends: 14923 [2019-12-18 22:18:30,775 INFO L631 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-12-18 22:18:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2019-12-18 22:18:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 12415. [2019-12-18 22:18:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12415 states. [2019-12-18 22:18:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12415 states to 12415 states and 39778 transitions. [2019-12-18 22:18:30,987 INFO L78 Accepts]: Start accepts. Automaton has 12415 states and 39778 transitions. Word has length 54 [2019-12-18 22:18:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:30,987 INFO L462 AbstractCegarLoop]: Abstraction has 12415 states and 39778 transitions. [2019-12-18 22:18:30,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 12415 states and 39778 transitions. [2019-12-18 22:18:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:31,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:31,007 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:31,008 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 81383116, now seen corresponding path program 1 times [2019-12-18 22:18:31,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:31,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187999029] [2019-12-18 22:18:31,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:31,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187999029] [2019-12-18 22:18:31,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:31,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:31,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120083286] [2019-12-18 22:18:31,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:31,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:31,125 INFO L87 Difference]: Start difference. First operand 12415 states and 39778 transitions. Second operand 4 states. [2019-12-18 22:18:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:31,257 INFO L93 Difference]: Finished difference Result 23746 states and 76295 transitions. [2019-12-18 22:18:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:18:31,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:18:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:31,284 INFO L225 Difference]: With dead ends: 23746 [2019-12-18 22:18:31,284 INFO L226 Difference]: Without dead ends: 11640 [2019-12-18 22:18:31,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2019-12-18 22:18:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11640. [2019-12-18 22:18:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11640 states. [2019-12-18 22:18:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 37407 transitions. [2019-12-18 22:18:31,512 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 37407 transitions. Word has length 54 [2019-12-18 22:18:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:31,512 INFO L462 AbstractCegarLoop]: Abstraction has 11640 states and 37407 transitions. [2019-12-18 22:18:31,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 37407 transitions. [2019-12-18 22:18:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:31,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:31,528 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:31,528 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -886395566, now seen corresponding path program 2 times [2019-12-18 22:18:31,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:31,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890672902] [2019-12-18 22:18:31,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:31,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890672902] [2019-12-18 22:18:31,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:31,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:18:31,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694460805] [2019-12-18 22:18:31,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:18:31,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:31,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:18:31,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:18:31,595 INFO L87 Difference]: Start difference. First operand 11640 states and 37407 transitions. Second operand 4 states. [2019-12-18 22:18:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:31,942 INFO L93 Difference]: Finished difference Result 29764 states and 97472 transitions. [2019-12-18 22:18:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:18:31,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:18:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:31,955 INFO L225 Difference]: With dead ends: 29764 [2019-12-18 22:18:31,955 INFO L226 Difference]: Without dead ends: 5215 [2019-12-18 22:18:31,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:18:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-12-18 22:18:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2019-12-18 22:18:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2019-12-18 22:18:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 17564 transitions. [2019-12-18 22:18:32,134 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 17564 transitions. Word has length 54 [2019-12-18 22:18:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:32,134 INFO L462 AbstractCegarLoop]: Abstraction has 5215 states and 17564 transitions. [2019-12-18 22:18:32,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:18:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 17564 transitions. [2019-12-18 22:18:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:32,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:32,143 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:32,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:32,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:32,144 INFO L82 PathProgramCache]: Analyzing trace with hash 139987658, now seen corresponding path program 3 times [2019-12-18 22:18:32,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:32,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052123193] [2019-12-18 22:18:32,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:32,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052123193] [2019-12-18 22:18:32,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:32,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:32,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435404391] [2019-12-18 22:18:32,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:32,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:32,282 INFO L87 Difference]: Start difference. First operand 5215 states and 17564 transitions. Second operand 7 states. [2019-12-18 22:18:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:32,547 INFO L93 Difference]: Finished difference Result 9815 states and 32405 transitions. [2019-12-18 22:18:32,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:32,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:32,562 INFO L225 Difference]: With dead ends: 9815 [2019-12-18 22:18:32,562 INFO L226 Difference]: Without dead ends: 7165 [2019-12-18 22:18:32,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-12-18 22:18:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 6422. [2019-12-18 22:18:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-12-18 22:18:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 21551 transitions. [2019-12-18 22:18:32,678 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 21551 transitions. Word has length 54 [2019-12-18 22:18:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:32,679 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 21551 transitions. [2019-12-18 22:18:32,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 21551 transitions. [2019-12-18 22:18:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:32,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:32,687 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:32,687 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1645888394, now seen corresponding path program 4 times [2019-12-18 22:18:32,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:32,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071367119] [2019-12-18 22:18:32,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:32,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071367119] [2019-12-18 22:18:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380529889] [2019-12-18 22:18:32,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:32,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:32,773 INFO L87 Difference]: Start difference. First operand 6422 states and 21551 transitions. Second operand 7 states. [2019-12-18 22:18:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:33,055 INFO L93 Difference]: Finished difference Result 11902 states and 38980 transitions. [2019-12-18 22:18:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:18:33,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:33,078 INFO L225 Difference]: With dead ends: 11902 [2019-12-18 22:18:33,079 INFO L226 Difference]: Without dead ends: 8756 [2019-12-18 22:18:33,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8756 states. [2019-12-18 22:18:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8756 to 7826. [2019-12-18 22:18:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7826 states. [2019-12-18 22:18:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 26019 transitions. [2019-12-18 22:18:33,308 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 26019 transitions. Word has length 54 [2019-12-18 22:18:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:33,309 INFO L462 AbstractCegarLoop]: Abstraction has 7826 states and 26019 transitions. [2019-12-18 22:18:33,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 26019 transitions. [2019-12-18 22:18:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:33,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:33,323 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:33,323 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1656812138, now seen corresponding path program 5 times [2019-12-18 22:18:33,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:33,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366492615] [2019-12-18 22:18:33,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:33,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366492615] [2019-12-18 22:18:33,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:33,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:18:33,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787321489] [2019-12-18 22:18:33,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:33,436 INFO L87 Difference]: Start difference. First operand 7826 states and 26019 transitions. Second operand 7 states. [2019-12-18 22:18:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:33,833 INFO L93 Difference]: Finished difference Result 17215 states and 55787 transitions. [2019-12-18 22:18:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:18:33,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:33,869 INFO L225 Difference]: With dead ends: 17215 [2019-12-18 22:18:33,870 INFO L226 Difference]: Without dead ends: 14695 [2019-12-18 22:18:33,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:18:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14695 states. [2019-12-18 22:18:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14695 to 7986. [2019-12-18 22:18:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7986 states. [2019-12-18 22:18:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7986 states to 7986 states and 26559 transitions. [2019-12-18 22:18:34,140 INFO L78 Accepts]: Start accepts. Automaton has 7986 states and 26559 transitions. Word has length 54 [2019-12-18 22:18:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:34,141 INFO L462 AbstractCegarLoop]: Abstraction has 7986 states and 26559 transitions. [2019-12-18 22:18:34,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7986 states and 26559 transitions. [2019-12-18 22:18:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:34,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:34,150 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:34,150 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash -434377068, now seen corresponding path program 6 times [2019-12-18 22:18:34,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:34,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038060767] [2019-12-18 22:18:34,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:34,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038060767] [2019-12-18 22:18:34,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:34,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:34,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796518224] [2019-12-18 22:18:34,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:18:34,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:34,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:18:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:18:34,287 INFO L87 Difference]: Start difference. First operand 7986 states and 26559 transitions. Second operand 8 states. [2019-12-18 22:18:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:35,392 INFO L93 Difference]: Finished difference Result 20061 states and 62674 transitions. [2019-12-18 22:18:35,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:18:35,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 22:18:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:35,420 INFO L225 Difference]: With dead ends: 20061 [2019-12-18 22:18:35,420 INFO L226 Difference]: Without dead ends: 19977 [2019-12-18 22:18:35,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19977 states. [2019-12-18 22:18:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19977 to 13288. [2019-12-18 22:18:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13288 states. [2019-12-18 22:18:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 41695 transitions. [2019-12-18 22:18:35,833 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 41695 transitions. Word has length 54 [2019-12-18 22:18:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:35,833 INFO L462 AbstractCegarLoop]: Abstraction has 13288 states and 41695 transitions. [2019-12-18 22:18:35,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:18:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 41695 transitions. [2019-12-18 22:18:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:35,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:35,853 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:35,854 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash -458785952, now seen corresponding path program 7 times [2019-12-18 22:18:35,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:35,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228345742] [2019-12-18 22:18:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:35,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228345742] [2019-12-18 22:18:35,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:35,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:18:35,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658807084] [2019-12-18 22:18:35,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:18:35,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:35,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:18:35,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:18:35,978 INFO L87 Difference]: Start difference. First operand 13288 states and 41695 transitions. Second operand 7 states. [2019-12-18 22:18:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:36,724 INFO L93 Difference]: Finished difference Result 21346 states and 65008 transitions. [2019-12-18 22:18:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:18:36,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:18:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:36,759 INFO L225 Difference]: With dead ends: 21346 [2019-12-18 22:18:36,760 INFO L226 Difference]: Without dead ends: 21236 [2019-12-18 22:18:36,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-18 22:18:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 17446. [2019-12-18 22:18:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-12-18 22:18:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 54229 transitions. [2019-12-18 22:18:37,066 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 54229 transitions. Word has length 54 [2019-12-18 22:18:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:37,066 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 54229 transitions. [2019-12-18 22:18:37,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:18:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 54229 transitions. [2019-12-18 22:18:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:18:37,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:37,094 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:37,095 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2051129792, now seen corresponding path program 8 times [2019-12-18 22:18:37,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:37,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079883108] [2019-12-18 22:18:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:37,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079883108] [2019-12-18 22:18:37,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:37,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:37,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123865745] [2019-12-18 22:18:37,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:37,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:37,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:37,160 INFO L87 Difference]: Start difference. First operand 17446 states and 54229 transitions. Second operand 3 states. [2019-12-18 22:18:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:37,221 INFO L93 Difference]: Finished difference Result 11033 states and 34214 transitions. [2019-12-18 22:18:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:37,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:18:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:37,242 INFO L225 Difference]: With dead ends: 11033 [2019-12-18 22:18:37,242 INFO L226 Difference]: Without dead ends: 11033 [2019-12-18 22:18:37,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11033 states. [2019-12-18 22:18:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11033 to 10642. [2019-12-18 22:18:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10642 states. [2019-12-18 22:18:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10642 states to 10642 states and 32991 transitions. [2019-12-18 22:18:37,425 INFO L78 Accepts]: Start accepts. Automaton has 10642 states and 32991 transitions. Word has length 54 [2019-12-18 22:18:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:37,425 INFO L462 AbstractCegarLoop]: Abstraction has 10642 states and 32991 transitions. [2019-12-18 22:18:37,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10642 states and 32991 transitions. [2019-12-18 22:18:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:37,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:37,437 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:37,437 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash -318791943, now seen corresponding path program 1 times [2019-12-18 22:18:37,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:37,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437005869] [2019-12-18 22:18:37,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:37,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437005869] [2019-12-18 22:18:37,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:37,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:37,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576465852] [2019-12-18 22:18:37,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:18:37,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:18:37,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:18:37,536 INFO L87 Difference]: Start difference. First operand 10642 states and 32991 transitions. Second operand 8 states. [2019-12-18 22:18:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:38,721 INFO L93 Difference]: Finished difference Result 14753 states and 44394 transitions. [2019-12-18 22:18:38,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:18:38,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 22:18:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:38,755 INFO L225 Difference]: With dead ends: 14753 [2019-12-18 22:18:38,755 INFO L226 Difference]: Without dead ends: 14645 [2019-12-18 22:18:38,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:18:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14645 states. [2019-12-18 22:18:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14645 to 11236. [2019-12-18 22:18:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11236 states. [2019-12-18 22:18:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11236 states to 11236 states and 34702 transitions. [2019-12-18 22:18:39,338 INFO L78 Accepts]: Start accepts. Automaton has 11236 states and 34702 transitions. Word has length 55 [2019-12-18 22:18:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 11236 states and 34702 transitions. [2019-12-18 22:18:39,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:18:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11236 states and 34702 transitions. [2019-12-18 22:18:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:39,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:39,356 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:39,357 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1048892077, now seen corresponding path program 2 times [2019-12-18 22:18:39,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:39,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797672852] [2019-12-18 22:18:39,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:39,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797672852] [2019-12-18 22:18:39,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:39,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:39,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137837433] [2019-12-18 22:18:39,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:18:39,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:18:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:39,549 INFO L87 Difference]: Start difference. First operand 11236 states and 34702 transitions. Second operand 10 states. [2019-12-18 22:18:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:40,523 INFO L93 Difference]: Finished difference Result 17280 states and 52746 transitions. [2019-12-18 22:18:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:18:40,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 22:18:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:40,543 INFO L225 Difference]: With dead ends: 17280 [2019-12-18 22:18:40,543 INFO L226 Difference]: Without dead ends: 12312 [2019-12-18 22:18:40,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:18:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12312 states. [2019-12-18 22:18:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12312 to 11478. [2019-12-18 22:18:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11478 states. [2019-12-18 22:18:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11478 states to 11478 states and 35266 transitions. [2019-12-18 22:18:40,728 INFO L78 Accepts]: Start accepts. Automaton has 11478 states and 35266 transitions. Word has length 55 [2019-12-18 22:18:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:40,728 INFO L462 AbstractCegarLoop]: Abstraction has 11478 states and 35266 transitions. [2019-12-18 22:18:40,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:18:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11478 states and 35266 transitions. [2019-12-18 22:18:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:40,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:40,742 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:40,742 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1460850481, now seen corresponding path program 3 times [2019-12-18 22:18:40,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:40,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480362425] [2019-12-18 22:18:40,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:40,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480362425] [2019-12-18 22:18:40,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:40,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:18:40,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239919439] [2019-12-18 22:18:40,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:18:40,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:18:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:18:40,911 INFO L87 Difference]: Start difference. First operand 11478 states and 35266 transitions. Second operand 10 states. [2019-12-18 22:18:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:41,932 INFO L93 Difference]: Finished difference Result 17727 states and 53256 transitions. [2019-12-18 22:18:41,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:18:41,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 22:18:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:41,954 INFO L225 Difference]: With dead ends: 17727 [2019-12-18 22:18:41,954 INFO L226 Difference]: Without dead ends: 14029 [2019-12-18 22:18:41,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:18:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14029 states. [2019-12-18 22:18:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14029 to 11970. [2019-12-18 22:18:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11970 states. [2019-12-18 22:18:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11970 states to 11970 states and 36436 transitions. [2019-12-18 22:18:42,145 INFO L78 Accepts]: Start accepts. Automaton has 11970 states and 36436 transitions. Word has length 55 [2019-12-18 22:18:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:42,145 INFO L462 AbstractCegarLoop]: Abstraction has 11970 states and 36436 transitions. [2019-12-18 22:18:42,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:18:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11970 states and 36436 transitions. [2019-12-18 22:18:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:42,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:42,157 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:42,157 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1440625269, now seen corresponding path program 4 times [2019-12-18 22:18:42,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:42,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282170919] [2019-12-18 22:18:42,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:42,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282170919] [2019-12-18 22:18:42,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:42,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:42,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636496362] [2019-12-18 22:18:42,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:42,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:42,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:42,383 INFO L87 Difference]: Start difference. First operand 11970 states and 36436 transitions. Second operand 11 states. [2019-12-18 22:18:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:43,357 INFO L93 Difference]: Finished difference Result 16792 states and 50242 transitions. [2019-12-18 22:18:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:18:43,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:43,383 INFO L225 Difference]: With dead ends: 16792 [2019-12-18 22:18:43,383 INFO L226 Difference]: Without dead ends: 13469 [2019-12-18 22:18:43,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:18:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13469 states. [2019-12-18 22:18:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13469 to 11643. [2019-12-18 22:18:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11643 states. [2019-12-18 22:18:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11643 states to 11643 states and 35471 transitions. [2019-12-18 22:18:43,684 INFO L78 Accepts]: Start accepts. Automaton has 11643 states and 35471 transitions. Word has length 55 [2019-12-18 22:18:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:43,684 INFO L462 AbstractCegarLoop]: Abstraction has 11643 states and 35471 transitions. [2019-12-18 22:18:43,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 11643 states and 35471 transitions. [2019-12-18 22:18:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:43,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:43,945 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:43,945 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash 331505035, now seen corresponding path program 5 times [2019-12-18 22:18:43,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:43,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574134650] [2019-12-18 22:18:43,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:44,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574134650] [2019-12-18 22:18:44,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:44,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:44,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963588285] [2019-12-18 22:18:44,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:44,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:44,120 INFO L87 Difference]: Start difference. First operand 11643 states and 35471 transitions. Second operand 11 states. [2019-12-18 22:18:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:45,185 INFO L93 Difference]: Finished difference Result 14831 states and 44739 transitions. [2019-12-18 22:18:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:18:45,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:45,204 INFO L225 Difference]: With dead ends: 14831 [2019-12-18 22:18:45,205 INFO L226 Difference]: Without dead ends: 12844 [2019-12-18 22:18:45,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:18:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2019-12-18 22:18:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 11810. [2019-12-18 22:18:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11810 states. [2019-12-18 22:18:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 35890 transitions. [2019-12-18 22:18:45,391 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 35890 transitions. Word has length 55 [2019-12-18 22:18:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:45,392 INFO L462 AbstractCegarLoop]: Abstraction has 11810 states and 35890 transitions. [2019-12-18 22:18:45,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 35890 transitions. [2019-12-18 22:18:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:45,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:45,405 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:45,406 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:45,406 INFO L82 PathProgramCache]: Analyzing trace with hash -826291291, now seen corresponding path program 6 times [2019-12-18 22:18:45,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:45,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185706519] [2019-12-18 22:18:45,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:45,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185706519] [2019-12-18 22:18:45,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:45,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:45,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826506298] [2019-12-18 22:18:45,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:45,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:45,549 INFO L87 Difference]: Start difference. First operand 11810 states and 35890 transitions. Second operand 11 states. [2019-12-18 22:18:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:46,651 INFO L93 Difference]: Finished difference Result 14436 states and 43208 transitions. [2019-12-18 22:18:46,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:18:46,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:46,671 INFO L225 Difference]: With dead ends: 14436 [2019-12-18 22:18:46,672 INFO L226 Difference]: Without dead ends: 13473 [2019-12-18 22:18:46,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:18:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13473 states. [2019-12-18 22:18:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13473 to 11759. [2019-12-18 22:18:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11759 states. [2019-12-18 22:18:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 35734 transitions. [2019-12-18 22:18:46,868 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 35734 transitions. Word has length 55 [2019-12-18 22:18:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:46,868 INFO L462 AbstractCegarLoop]: Abstraction has 11759 states and 35734 transitions. [2019-12-18 22:18:46,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 35734 transitions. [2019-12-18 22:18:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:46,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:46,881 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:46,882 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -830533993, now seen corresponding path program 7 times [2019-12-18 22:18:46,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:46,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110021786] [2019-12-18 22:18:46,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:47,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110021786] [2019-12-18 22:18:47,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:47,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:47,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623372298] [2019-12-18 22:18:47,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:47,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:47,038 INFO L87 Difference]: Start difference. First operand 11759 states and 35734 transitions. Second operand 11 states. [2019-12-18 22:18:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:47,860 INFO L93 Difference]: Finished difference Result 15912 states and 47902 transitions. [2019-12-18 22:18:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 22:18:47,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:47,883 INFO L225 Difference]: With dead ends: 15912 [2019-12-18 22:18:47,883 INFO L226 Difference]: Without dead ends: 15348 [2019-12-18 22:18:47,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:18:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15348 states. [2019-12-18 22:18:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15348 to 14300. [2019-12-18 22:18:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14300 states. [2019-12-18 22:18:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 43123 transitions. [2019-12-18 22:18:48,113 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 43123 transitions. Word has length 55 [2019-12-18 22:18:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:48,114 INFO L462 AbstractCegarLoop]: Abstraction has 14300 states and 43123 transitions. [2019-12-18 22:18:48,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 43123 transitions. [2019-12-18 22:18:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:48,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:48,136 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:48,137 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2141520489, now seen corresponding path program 8 times [2019-12-18 22:18:48,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:48,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086419296] [2019-12-18 22:18:48,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:48,393 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 22:18:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:48,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086419296] [2019-12-18 22:18:48,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:48,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:18:48,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398434441] [2019-12-18 22:18:48,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:18:48,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:18:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:18:48,493 INFO L87 Difference]: Start difference. First operand 14300 states and 43123 transitions. Second operand 11 states. [2019-12-18 22:18:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:49,261 INFO L93 Difference]: Finished difference Result 15829 states and 47070 transitions. [2019-12-18 22:18:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:18:49,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:18:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:49,279 INFO L225 Difference]: With dead ends: 15829 [2019-12-18 22:18:49,279 INFO L226 Difference]: Without dead ends: 12281 [2019-12-18 22:18:49,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:18:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2019-12-18 22:18:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 10989. [2019-12-18 22:18:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10989 states. [2019-12-18 22:18:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10989 states to 10989 states and 33472 transitions. [2019-12-18 22:18:49,449 INFO L78 Accepts]: Start accepts. Automaton has 10989 states and 33472 transitions. Word has length 55 [2019-12-18 22:18:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:49,449 INFO L462 AbstractCegarLoop]: Abstraction has 10989 states and 33472 transitions. [2019-12-18 22:18:49,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:18:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10989 states and 33472 transitions. [2019-12-18 22:18:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:18:49,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:49,460 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:49,460 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash 975434899, now seen corresponding path program 9 times [2019-12-18 22:18:49,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:49,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598059012] [2019-12-18 22:18:49,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:49,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598059012] [2019-12-18 22:18:49,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:49,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:18:49,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975706539] [2019-12-18 22:18:49,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:18:49,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:49,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:18:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:49,510 INFO L87 Difference]: Start difference. First operand 10989 states and 33472 transitions. Second operand 3 states. [2019-12-18 22:18:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:49,555 INFO L93 Difference]: Finished difference Result 10989 states and 33470 transitions. [2019-12-18 22:18:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:18:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:18:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:49,574 INFO L225 Difference]: With dead ends: 10989 [2019-12-18 22:18:49,574 INFO L226 Difference]: Without dead ends: 10989 [2019-12-18 22:18:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:18:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10989 states. [2019-12-18 22:18:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10989 to 10189. [2019-12-18 22:18:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10189 states. [2019-12-18 22:18:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10189 states to 10189 states and 31259 transitions. [2019-12-18 22:18:49,755 INFO L78 Accepts]: Start accepts. Automaton has 10189 states and 31259 transitions. Word has length 55 [2019-12-18 22:18:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:49,755 INFO L462 AbstractCegarLoop]: Abstraction has 10189 states and 31259 transitions. [2019-12-18 22:18:49,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:18:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10189 states and 31259 transitions. [2019-12-18 22:18:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:18:49,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:49,767 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:49,767 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1725340389, now seen corresponding path program 1 times [2019-12-18 22:18:49,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:49,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494751999] [2019-12-18 22:18:49,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:18:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:18:49,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494751999] [2019-12-18 22:18:49,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:18:49,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:18:49,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774870145] [2019-12-18 22:18:49,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:18:49,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:18:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:18:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:18:49,969 INFO L87 Difference]: Start difference. First operand 10189 states and 31259 transitions. Second operand 12 states. [2019-12-18 22:18:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:18:50,789 INFO L93 Difference]: Finished difference Result 11221 states and 33973 transitions. [2019-12-18 22:18:50,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:18:50,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:18:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:18:50,805 INFO L225 Difference]: With dead ends: 11221 [2019-12-18 22:18:50,805 INFO L226 Difference]: Without dead ends: 10941 [2019-12-18 22:18:50,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:18:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10941 states. [2019-12-18 22:18:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10941 to 10039. [2019-12-18 22:18:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10039 states. [2019-12-18 22:18:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 30905 transitions. [2019-12-18 22:18:50,959 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 30905 transitions. Word has length 56 [2019-12-18 22:18:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:18:50,959 INFO L462 AbstractCegarLoop]: Abstraction has 10039 states and 30905 transitions. [2019-12-18 22:18:50,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:18:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 30905 transitions. [2019-12-18 22:18:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:18:50,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:18:50,969 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:18:50,969 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:18:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:18:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1747486899, now seen corresponding path program 2 times [2019-12-18 22:18:50,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:18:50,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542940244] [2019-12-18 22:18:50,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:18:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:18:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:18:51,081 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:18:51,081 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:18:51,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_43 0) (= 0 v_~x$w_buff0_used~0_108) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~x$r_buff0_thd3~0_21) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1831~0.base_27| 4) |v_#length_23|) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_27| 1)) (= |v_#NULL.offset_3| 0) (= v_~x~0_26 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~y~0_19 0) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~weak$$choice2~0_32) (= (select .cse0 |v_ULTIMATE.start_main_~#t1831~0.base_27|) 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$w_buff0~0_25) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~x$flush_delayed~0_14 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1831~0.base_27|) |v_ULTIMATE.start_main_~#t1831~0.offset_19| 0))) (= 0 v_~x$r_buff0_thd1~0_74) (= v_~x$r_buff1_thd3~0_18 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= v_~x$mem_tmp~0_11 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$r_buff1_thd2~0_20 0) (= v_~__unbuffered_p0_EBX~0_16 0) (= |v_ULTIMATE.start_main_~#t1831~0.offset_19| 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1831~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_74, ULTIMATE.start_main_~#t1831~0.offset=|v_ULTIMATE.start_main_~#t1831~0.offset_19|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_19, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ULTIMATE.start_main_~#t1831~0.base=|v_ULTIMATE.start_main_~#t1831~0.base_27|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1831~0.offset, ULTIMATE.start_main_~#t1833~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1832~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1832~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1833~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1831~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:18:51,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1832~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1832~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1832~0.base_10|) |v_ULTIMATE.start_main_~#t1832~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1832~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1832~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1832~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1832~0.offset=|v_ULTIMATE.start_main_~#t1832~0.offset_10|, ULTIMATE.start_main_~#t1832~0.base=|v_ULTIMATE.start_main_~#t1832~0.base_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1832~0.offset, ULTIMATE.start_main_~#t1832~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 22:18:51,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1833~0.base_10|) |v_ULTIMATE.start_main_~#t1833~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1833~0.offset_9| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1833~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1833~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1833~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1833~0.offset=|v_ULTIMATE.start_main_~#t1833~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1833~0.base=|v_ULTIMATE.start_main_~#t1833~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1833~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1833~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:18:51,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:18:51,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In363404303 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In363404303 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In363404303 |P2Thread1of1ForFork1_#t~ite32_Out363404303|)) (and (not .cse0) (= ~x$w_buff1~0_In363404303 |P2Thread1of1ForFork1_#t~ite32_Out363404303|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In363404303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363404303, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In363404303, ~x~0=~x~0_In363404303} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out363404303|, ~x$w_buff1~0=~x$w_buff1~0_In363404303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363404303, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In363404303, ~x~0=~x~0_In363404303} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:18:51,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1318429211 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1318429211 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1318429211| ~x$w_buff0_used~0_In-1318429211)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1318429211|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1318429211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1318429211} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1318429211, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1318429211|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1318429211} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:18:51,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:18:51,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1661787481 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1661787481 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1661787481 |P2Thread1of1ForFork1_#t~ite34_Out-1661787481|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1661787481| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1661787481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1661787481} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1661787481|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1661787481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1661787481} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:18:51,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-1692462252 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1692462252 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1692462252 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1692462252 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1692462252| ~x$w_buff1_used~0_In-1692462252)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1692462252| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692462252, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1692462252, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1692462252, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1692462252} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692462252, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1692462252, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1692462252, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1692462252|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1692462252} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:18:51,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1123833600 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1123833600 256)))) (or (and (= ~x$r_buff0_thd2~0_Out1123833600 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1123833600 ~x$r_buff0_thd2~0_In1123833600)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1123833600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123833600} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1123833600|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1123833600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123833600} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:18:51,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-313248922 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-313248922 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-313248922 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-313248922 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-313248922| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-313248922| ~x$r_buff1_thd2~0_In-313248922)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-313248922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-313248922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-313248922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-313248922} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-313248922|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-313248922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-313248922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-313248922, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-313248922} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:18:51,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_16 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:18:51,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In757594459 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In757594459 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In757594459 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In757594459 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out757594459|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In757594459 |P2Thread1of1ForFork1_#t~ite35_Out757594459|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In757594459, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In757594459, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In757594459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757594459} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out757594459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In757594459, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In757594459, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In757594459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In757594459} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:18:51,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-737914189 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-737914189 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-737914189| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-737914189| ~x$r_buff0_thd3~0_In-737914189)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-737914189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737914189} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-737914189|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-737914189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737914189} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:18:51,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In679642300 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out679642300| ~x$w_buff1~0_In679642300) (= |P0Thread1of1ForFork2_#t~ite11_In679642300| |P0Thread1of1ForFork2_#t~ite11_Out679642300|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out679642300| ~x$w_buff1~0_In679642300) (= |P0Thread1of1ForFork2_#t~ite12_Out679642300| |P0Thread1of1ForFork2_#t~ite11_Out679642300|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In679642300 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In679642300 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In679642300 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In679642300 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In679642300, ~x$w_buff1~0=~x$w_buff1~0_In679642300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In679642300, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In679642300, ~weak$$choice2~0=~weak$$choice2~0_In679642300, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In679642300|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In679642300} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In679642300, ~x$w_buff1~0=~x$w_buff1~0_In679642300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In679642300, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In679642300, ~weak$$choice2~0=~weak$$choice2~0_In679642300, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out679642300|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out679642300|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In679642300} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:18:51,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1239660788 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1239660788| |P0Thread1of1ForFork2_#t~ite14_Out1239660788|) (= |P0Thread1of1ForFork2_#t~ite15_Out1239660788| ~x$w_buff0_used~0_In1239660788)) (and (= ~x$w_buff0_used~0_In1239660788 |P0Thread1of1ForFork2_#t~ite14_Out1239660788|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out1239660788| |P0Thread1of1ForFork2_#t~ite14_Out1239660788|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1239660788 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1239660788 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1239660788 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1239660788 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1239660788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239660788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1239660788, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1239660788|, ~weak$$choice2~0=~weak$$choice2~0_In1239660788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239660788} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1239660788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1239660788, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1239660788|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1239660788, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1239660788|, ~weak$$choice2~0=~weak$$choice2~0_In1239660788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1239660788} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:18:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_54 v_~x$r_buff0_thd1~0_53) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:18:51,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-83281862 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-83281862 |P0Thread1of1ForFork2_#t~ite24_Out-83281862|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-83281862| |P0Thread1of1ForFork2_#t~ite23_Out-83281862|)) (and (= ~x$r_buff1_thd1~0_In-83281862 |P0Thread1of1ForFork2_#t~ite23_Out-83281862|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-83281862 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-83281862 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-83281862 256) 0)) (= (mod ~x$w_buff0_used~0_In-83281862 256) 0))) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-83281862| |P0Thread1of1ForFork2_#t~ite23_Out-83281862|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83281862, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-83281862, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-83281862, ~weak$$choice2~0=~weak$$choice2~0_In-83281862, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-83281862|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83281862} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83281862, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-83281862, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-83281862, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-83281862|, ~weak$$choice2~0=~weak$$choice2~0_In-83281862, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-83281862|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83281862} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 22:18:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:18:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1645904381 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1645904381 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1645904381 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1645904381 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1645904381|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1645904381| ~x$r_buff1_thd3~0_In1645904381) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1645904381, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1645904381, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1645904381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645904381} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1645904381|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1645904381, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1645904381, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1645904381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645904381} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:18:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:18:51,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:18:51,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In639013548 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In639013548 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite41_Out639013548| |ULTIMATE.start_main_#t~ite42_Out639013548|))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out639013548| ~x~0_In639013548) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite41_Out639013548| ~x$w_buff1~0_In639013548) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In639013548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In639013548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In639013548, ~x~0=~x~0_In639013548} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out639013548|, ~x$w_buff1~0=~x$w_buff1~0_In639013548, ~x$w_buff1_used~0=~x$w_buff1_used~0_In639013548, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In639013548, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out639013548|, ~x~0=~x~0_In639013548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:18:51,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1617131381 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1617131381 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1617131381| ~x$w_buff0_used~0_In1617131381)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1617131381|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1617131381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1617131381} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1617131381, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1617131381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1617131381} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:18:51,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1416795103 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1416795103 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1416795103 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1416795103 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1416795103|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1416795103 |ULTIMATE.start_main_#t~ite44_Out-1416795103|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1416795103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416795103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1416795103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416795103} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1416795103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1416795103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1416795103, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1416795103|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1416795103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:18:51,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-357142579 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-357142579 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-357142579| ~x$r_buff0_thd0~0_In-357142579)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-357142579| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-357142579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-357142579} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-357142579, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-357142579|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-357142579} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:18:51,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-477977853 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-477977853 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-477977853 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-477977853 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-477977853| ~x$r_buff1_thd0~0_In-477977853) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-477977853| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-477977853, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-477977853, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-477977853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477977853} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-477977853, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-477977853|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-477977853, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-477977853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477977853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:18:51,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p0_EAX~0_9 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:18:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:18:51 BasicIcfg [2019-12-18 22:18:51,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:18:51,197 INFO L168 Benchmark]: Toolchain (without parser) took 64276.11 ms. Allocated memory was 138.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 101.3 MB in the beginning and 791.6 MB in the end (delta: -690.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,198 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.36 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,204 INFO L168 Benchmark]: Boogie Preprocessor took 41.12 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,205 INFO L168 Benchmark]: RCFGBuilder took 850.97 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 105.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,205 INFO L168 Benchmark]: TraceAbstraction took 62533.66 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.3 MB in the beginning and 791.6 MB in the end (delta: -686.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:18:51,211 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.36 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.80 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.12 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.97 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 105.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62533.66 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.3 MB in the beginning and 791.6 MB in the end (delta: -686.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 93 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6473 VarBasedMoverChecksPositive, 209 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75395 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1831, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1832, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1833, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4766 SDtfs, 6582 SDslu, 17715 SDs, 0 SdLazy, 10822 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 41 SyntacticMatches, 18 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89162occurred 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: 18.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 91185 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 228121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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...