/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 23:17:25,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 23:17:25,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 23:17:25,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 23:17:25,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 23:17:25,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 23:17:25,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 23:17:25,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 23:17:25,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 23:17:25,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 23:17:25,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 23:17:25,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 23:17:25,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 23:17:25,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 23:17:25,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 23:17:25,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 23:17:25,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 23:17:25,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 23:17:25,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 23:17:25,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 23:17:25,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 23:17:25,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 23:17:25,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 23:17:25,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 23:17:25,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 23:17:25,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 23:17:25,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 23:17:25,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 23:17:25,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 23:17:25,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 23:17:25,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 23:17:25,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 23:17:25,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 23:17:25,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 23:17:25,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 23:17:25,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 23:17:25,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 23:17:25,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 23:17:25,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 23:17:25,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 23:17:25,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 23:17:25,823 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-SemanticLbe.epf [2020-11-11 23:17:25,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 23:17:25,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 23:17:25,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 23:17:25,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 23:17:25,855 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 23:17:25,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 23:17:25,856 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 23:17:25,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 23:17:25,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 23:17:25,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 23:17:25,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 23:17:25,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 23:17:25,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 23:17:25,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 23:17:25,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 23:17:25,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 23:17:25,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 23:17:25,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 23:17:25,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 23:17:25,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 23:17:25,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 23:17:25,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:17:25,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 23:17:25,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 23:17:25,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 23:17:25,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 23:17:25,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 23:17:25,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 23:17:25,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-11 23:17:26,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 23:17:26,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 23:17:26,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 23:17:26,386 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 23:17:26,387 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 23:17:26,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2020-11-11 23:17:26,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf8111b0/6220a682ce864ddaa3fca84f379b23f9/FLAGb3740c746 [2020-11-11 23:17:27,240 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 23:17:27,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2020-11-11 23:17:27,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf8111b0/6220a682ce864ddaa3fca84f379b23f9/FLAGb3740c746 [2020-11-11 23:17:27,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf8111b0/6220a682ce864ddaa3fca84f379b23f9 [2020-11-11 23:17:27,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 23:17:27,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 23:17:27,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 23:17:27,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 23:17:27,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 23:17:27,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:17:27" (1/1) ... [2020-11-11 23:17:27,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc0e02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:27, skipping insertion in model container [2020-11-11 23:17:27,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:17:27" (1/1) ... [2020-11-11 23:17:27,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 23:17:27,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 23:17:28,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:17:28,225 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 23:17:28,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:17:28,505 INFO L208 MainTranslator]: Completed translation [2020-11-11 23:17:28,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28 WrapperNode [2020-11-11 23:17:28,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 23:17:28,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 23:17:28,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 23:17:28,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 23:17:28,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 23:17:28,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 23:17:28,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 23:17:28,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 23:17:28,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... [2020-11-11 23:17:28,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 23:17:28,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 23:17:28,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 23:17:28,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 23:17:28,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:17:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 23:17:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 23:17:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 23:17:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 23:17:28,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 23:17:28,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 23:17:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 23:17:28,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 23:17:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 23:17:28,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 23:17:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-11 23:17:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-11 23:17:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 23:17:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 23:17:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 23:17:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 23:17:28,794 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 23:17:31,246 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 23:17:31,246 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 23:17:31,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:17:31 BoogieIcfgContainer [2020-11-11 23:17:31,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 23:17:31,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 23:17:31,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 23:17:31,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 23:17:31,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:17:27" (1/3) ... [2020-11-11 23:17:31,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8d06a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:17:31, skipping insertion in model container [2020-11-11 23:17:31,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:17:28" (2/3) ... [2020-11-11 23:17:31,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8d06a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:17:31, skipping insertion in model container [2020-11-11 23:17:31,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:17:31" (3/3) ... [2020-11-11 23:17:31,258 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2020-11-11 23:17:31,276 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 23:17:31,276 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 23:17:31,280 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 23:17:31,281 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 23:17:31,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,331 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,331 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,333 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,333 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,333 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,334 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,355 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,355 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,356 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,356 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,356 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,357 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,358 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,374 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,380 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,381 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,381 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,386 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:17:31,387 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 23:17:31,401 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-11 23:17:31,426 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 23:17:31,426 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 23:17:31,426 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 23:17:31,426 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 23:17:31,426 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 23:17:31,427 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 23:17:31,427 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 23:17:31,427 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 23:17:31,442 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-11 23:17:31,444 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-11 23:17:31,448 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-11 23:17:31,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-11 23:17:31,523 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-11 23:17:31,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-11 23:17:31,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-11-11 23:17:31,538 INFO L116 LiptonReduction]: Number of co-enabled transitions 2712 [2020-11-11 23:17:32,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:17:32,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:32,403 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-11-11 23:17:32,513 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-11-11 23:17:32,662 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-11-11 23:17:33,161 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-11 23:17:33,274 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-11 23:17:33,862 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-11 23:17:33,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-11 23:17:33,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,288 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-11 23:17:34,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:34,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:34,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:34,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:34,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:17:34,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:34,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:34,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:34,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:34,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:17:34,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-11 23:17:34,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:34,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:34,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:34,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:34,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:34,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:34,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:34,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:34,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:34,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:34,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:34,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:34,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:34,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:35,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:35,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:35,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:35,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:35,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:35,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:35,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:35,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:35,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:35,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:35,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:35,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:35,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:35,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:35,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:35,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:36,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:36,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:36,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:36,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:36,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:36,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:36,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:36,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:36,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:36,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:36,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:36,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:36,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:36,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:36,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:17:36,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-11 23:17:36,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:36,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:36,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:36,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:36,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:17:36,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:17:36,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-11 23:17:36,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:36,873 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-11 23:17:36,993 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-11 23:17:37,209 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-11 23:17:37,455 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-11 23:17:38,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:17:38,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:17:38,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:17:38,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:38,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:38,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:17:38,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:17:38,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:17:38,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:17:38,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:17:38,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:17:38,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:17:38,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:38,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:17:38,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:17:40,434 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-11 23:17:40,577 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-11 23:17:40,718 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-11 23:17:40,884 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-11 23:17:41,492 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-11 23:17:41,762 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-11 23:17:42,353 WARN L193 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-11 23:17:42,617 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-11 23:17:42,625 INFO L131 LiptonReduction]: Checked pairs total: 6772 [2020-11-11 23:17:42,625 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-11 23:17:42,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-11-11 23:17:42,878 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-11 23:17:42,904 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:42,905 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:42,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash -531598001, now seen corresponding path program 1 times [2020-11-11 23:17:42,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:42,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528251165] [2020-11-11 23:17:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:43,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528251165] [2020-11-11 23:17:43,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:43,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:17:43,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247975510] [2020-11-11 23:17:43,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:17:43,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:43,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:17:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:17:43,332 INFO L87 Difference]: Start difference. First operand has 2858 states, 2854 states have (on average 4.0476524176594255) internal successors, (11552), 2857 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:43,502 INFO L93 Difference]: Finished difference Result 2474 states and 9536 transitions. [2020-11-11 23:17:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:17:43,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-11 23:17:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:43,562 INFO L225 Difference]: With dead ends: 2474 [2020-11-11 23:17:43,562 INFO L226 Difference]: Without dead ends: 2090 [2020-11-11 23:17:43,563 INFO L749 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 [2020-11-11 23:17:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-11-11 23:17:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-11-11 23:17:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 3.814265198659646) internal successors, (7968), 2089 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2020-11-11 23:17:43,789 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2020-11-11 23:17:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:43,790 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2020-11-11 23:17:43,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2020-11-11 23:17:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:17:43,802 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:43,802 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:43,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 23:17:43,802 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:43,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:43,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1289801197, now seen corresponding path program 1 times [2020-11-11 23:17:43,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:43,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129275134] [2020-11-11 23:17:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:43,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129275134] [2020-11-11 23:17:43,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:43,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:17:43,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429548788] [2020-11-11 23:17:43,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:17:43,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:17:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:17:43,932 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:44,001 INFO L93 Difference]: Finished difference Result 2378 states and 8760 transitions. [2020-11-11 23:17:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2020-11-11 23:17:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:44,023 INFO L225 Difference]: With dead ends: 2378 [2020-11-11 23:17:44,023 INFO L226 Difference]: Without dead ends: 1994 [2020-11-11 23:17:44,024 INFO L749 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 [2020-11-11 23:17:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-11-11 23:17:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-11-11 23:17:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 3.777220270948319) internal successors, (7528), 1993 states have internal predecessors, (7528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7528 transitions. [2020-11-11 23:17:44,136 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7528 transitions. Word has length 12 [2020-11-11 23:17:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:44,136 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7528 transitions. [2020-11-11 23:17:44,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7528 transitions. [2020-11-11 23:17:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-11 23:17:44,140 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:44,140 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:44,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 23:17:44,140 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -501628447, now seen corresponding path program 1 times [2020-11-11 23:17:44,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:44,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906013703] [2020-11-11 23:17:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:44,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906013703] [2020-11-11 23:17:44,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:44,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:17:44,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545326913] [2020-11-11 23:17:44,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:17:44,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:44,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:17:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:17:44,281 INFO L87 Difference]: Start difference. First operand 1994 states and 7528 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:44,341 INFO L93 Difference]: Finished difference Result 2106 states and 7716 transitions. [2020-11-11 23:17:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:44,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-11 23:17:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:44,360 INFO L225 Difference]: With dead ends: 2106 [2020-11-11 23:17:44,360 INFO L226 Difference]: Without dead ends: 1770 [2020-11-11 23:17:44,360 INFO L749 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 [2020-11-11 23:17:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-11-11 23:17:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2020-11-11 23:17:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 3.7263990955342) internal successors, (6592), 1769 states have internal predecessors, (6592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6592 transitions. [2020-11-11 23:17:44,436 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6592 transitions. Word has length 13 [2020-11-11 23:17:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:44,437 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 6592 transitions. [2020-11-11 23:17:44,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6592 transitions. [2020-11-11 23:17:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-11 23:17:44,441 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:44,441 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:44,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 23:17:44,441 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:44,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:44,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1412806912, now seen corresponding path program 1 times [2020-11-11 23:17:44,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:44,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119777594] [2020-11-11 23:17:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:44,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119777594] [2020-11-11 23:17:44,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:44,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:17:44,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612785781] [2020-11-11 23:17:44,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:17:44,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:17:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:17:44,544 INFO L87 Difference]: Start difference. First operand 1770 states and 6592 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:44,608 INFO L93 Difference]: Finished difference Result 1758 states and 5931 transitions. [2020-11-11 23:17:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-11 23:17:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:44,621 INFO L225 Difference]: With dead ends: 1758 [2020-11-11 23:17:44,621 INFO L226 Difference]: Without dead ends: 1374 [2020-11-11 23:17:44,621 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:17:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-11-11 23:17:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2020-11-11 23:17:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 3.3590677348871085) internal successors, (4612), 1373 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 4612 transitions. [2020-11-11 23:17:44,674 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 4612 transitions. Word has length 15 [2020-11-11 23:17:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:44,674 INFO L481 AbstractCegarLoop]: Abstraction has 1374 states and 4612 transitions. [2020-11-11 23:17:44,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 4612 transitions. [2020-11-11 23:17:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-11 23:17:44,678 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:44,678 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:44,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 23:17:44,678 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1054671020, now seen corresponding path program 1 times [2020-11-11 23:17:44,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:44,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571299383] [2020-11-11 23:17:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:44,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571299383] [2020-11-11 23:17:44,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:44,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:17:44,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903612343] [2020-11-11 23:17:44,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:17:44,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:17:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:17:44,779 INFO L87 Difference]: Start difference. First operand 1374 states and 4612 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:44,838 INFO L93 Difference]: Finished difference Result 2050 states and 6610 transitions. [2020-11-11 23:17:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-11 23:17:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:44,850 INFO L225 Difference]: With dead ends: 2050 [2020-11-11 23:17:44,850 INFO L226 Difference]: Without dead ends: 1448 [2020-11-11 23:17:44,851 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:17:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-11-11 23:17:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1328. [2020-11-11 23:17:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.2102486812358704) internal successors, (4260), 1327 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4260 transitions. [2020-11-11 23:17:44,906 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4260 transitions. Word has length 17 [2020-11-11 23:17:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:44,907 INFO L481 AbstractCegarLoop]: Abstraction has 1328 states and 4260 transitions. [2020-11-11 23:17:44,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4260 transitions. [2020-11-11 23:17:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-11 23:17:44,910 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:44,910 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:44,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 23:17:44,911 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2090315744, now seen corresponding path program 1 times [2020-11-11 23:17:44,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:44,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736364816] [2020-11-11 23:17:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:45,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736364816] [2020-11-11 23:17:45,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:45,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:17:45,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124020800] [2020-11-11 23:17:45,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:17:45,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:17:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:17:45,017 INFO L87 Difference]: Start difference. First operand 1328 states and 4260 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:45,178 INFO L93 Difference]: Finished difference Result 1091 states and 3142 transitions. [2020-11-11 23:17:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:17:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-11 23:17:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:45,186 INFO L225 Difference]: With dead ends: 1091 [2020-11-11 23:17:45,186 INFO L226 Difference]: Without dead ends: 842 [2020-11-11 23:17:45,186 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:17:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-11-11 23:17:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2020-11-11 23:17:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.8275862068965516) internal successors, (2378), 841 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2378 transitions. [2020-11-11 23:17:45,212 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2378 transitions. Word has length 17 [2020-11-11 23:17:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:45,213 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 2378 transitions. [2020-11-11 23:17:45,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2378 transitions. [2020-11-11 23:17:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-11 23:17:45,215 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:45,215 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:17:45,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 23:17:45,215 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash -634867226, now seen corresponding path program 1 times [2020-11-11 23:17:45,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:45,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831169108] [2020-11-11 23:17:45,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:45,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831169108] [2020-11-11 23:17:45,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:45,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:17:45,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888373547] [2020-11-11 23:17:45,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:17:45,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:17:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:17:45,350 INFO L87 Difference]: Start difference. First operand 842 states and 2378 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:45,437 INFO L93 Difference]: Finished difference Result 695 states and 1915 transitions. [2020-11-11 23:17:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:17:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-11 23:17:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:45,443 INFO L225 Difference]: With dead ends: 695 [2020-11-11 23:17:45,443 INFO L226 Difference]: Without dead ends: 608 [2020-11-11 23:17:45,445 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:17:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-11-11 23:17:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2020-11-11 23:17:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.7940691927512358) internal successors, (1696), 607 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1696 transitions. [2020-11-11 23:17:45,463 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1696 transitions. Word has length 20 [2020-11-11 23:17:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:45,464 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1696 transitions. [2020-11-11 23:17:45,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1696 transitions. [2020-11-11 23:17:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:17:45,466 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:45,467 INFO L494 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] [2020-11-11 23:17:45,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 23:17:45,467 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 377418094, now seen corresponding path program 1 times [2020-11-11 23:17:45,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:45,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567752339] [2020-11-11 23:17:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:45,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567752339] [2020-11-11 23:17:45,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:45,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 23:17:45,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842535614] [2020-11-11 23:17:45,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 23:17:45,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 23:17:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-11 23:17:45,665 INFO L87 Difference]: Start difference. First operand 608 states and 1696 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:45,966 INFO L93 Difference]: Finished difference Result 1013 states and 2678 transitions. [2020-11-11 23:17:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 23:17:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-11 23:17:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:45,972 INFO L225 Difference]: With dead ends: 1013 [2020-11-11 23:17:45,972 INFO L226 Difference]: Without dead ends: 739 [2020-11-11 23:17:45,973 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-11 23:17:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-11-11 23:17:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 624. [2020-11-11 23:17:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 2.57784911717496) internal successors, (1606), 623 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1606 transitions. [2020-11-11 23:17:45,995 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1606 transitions. Word has length 23 [2020-11-11 23:17:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:45,995 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 1606 transitions. [2020-11-11 23:17:45,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1606 transitions. [2020-11-11 23:17:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:17:45,997 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:45,997 INFO L494 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] [2020-11-11 23:17:45,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 23:17:45,998 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 847713258, now seen corresponding path program 1 times [2020-11-11 23:17:45,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:45,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986638133] [2020-11-11 23:17:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:46,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986638133] [2020-11-11 23:17:46,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:46,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:17:46,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296294779] [2020-11-11 23:17:46,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:17:46,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:17:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:17:46,094 INFO L87 Difference]: Start difference. First operand 624 states and 1606 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:46,145 INFO L93 Difference]: Finished difference Result 825 states and 2064 transitions. [2020-11-11 23:17:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-11 23:17:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:46,151 INFO L225 Difference]: With dead ends: 825 [2020-11-11 23:17:46,151 INFO L226 Difference]: Without dead ends: 504 [2020-11-11 23:17:46,151 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:17:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-11-11 23:17:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2020-11-11 23:17:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 2.3722334004024144) internal successors, (1179), 497 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1179 transitions. [2020-11-11 23:17:46,167 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1179 transitions. Word has length 23 [2020-11-11 23:17:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:46,167 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 1179 transitions. [2020-11-11 23:17:46,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1179 transitions. [2020-11-11 23:17:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:17:46,172 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:46,172 INFO L494 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] [2020-11-11 23:17:46,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 23:17:46,172 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1973619328, now seen corresponding path program 2 times [2020-11-11 23:17:46,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:46,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778812328] [2020-11-11 23:17:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:46,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778812328] [2020-11-11 23:17:46,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:46,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:17:46,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415097564] [2020-11-11 23:17:46,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:17:46,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:17:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:17:46,268 INFO L87 Difference]: Start difference. First operand 498 states and 1179 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:46,311 INFO L93 Difference]: Finished difference Result 602 states and 1369 transitions. [2020-11-11 23:17:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:17:46,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-11 23:17:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:46,315 INFO L225 Difference]: With dead ends: 602 [2020-11-11 23:17:46,315 INFO L226 Difference]: Without dead ends: 466 [2020-11-11 23:17:46,315 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:17:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-11-11 23:17:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 434. [2020-11-11 23:17:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.321016166281755) internal successors, (1005), 433 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1005 transitions. [2020-11-11 23:17:46,328 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1005 transitions. Word has length 23 [2020-11-11 23:17:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:46,328 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1005 transitions. [2020-11-11 23:17:46,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1005 transitions. [2020-11-11 23:17:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-11 23:17:46,330 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:46,330 INFO L494 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] [2020-11-11 23:17:46,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 23:17:46,330 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1673387358, now seen corresponding path program 3 times [2020-11-11 23:17:46,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:46,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463570981] [2020-11-11 23:17:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:46,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463570981] [2020-11-11 23:17:46,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:46,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 23:17:46,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916894238] [2020-11-11 23:17:46,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:17:46,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:17:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:17:46,431 INFO L87 Difference]: Start difference. First operand 434 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:46,517 INFO L93 Difference]: Finished difference Result 399 states and 936 transitions. [2020-11-11 23:17:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-11 23:17:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-11 23:17:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:46,519 INFO L225 Difference]: With dead ends: 399 [2020-11-11 23:17:46,519 INFO L226 Difference]: Without dead ends: 81 [2020-11-11 23:17:46,520 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-11 23:17:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-11 23:17:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-11-11 23:17:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.0875) internal successors, (167), 80 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions. [2020-11-11 23:17:46,522 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 23 [2020-11-11 23:17:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:46,523 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions. [2020-11-11 23:17:46,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions. [2020-11-11 23:17:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-11 23:17:46,523 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:46,524 INFO L494 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] [2020-11-11 23:17:46,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 23:17:46,524 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash -246252320, now seen corresponding path program 1 times [2020-11-11 23:17:46,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:46,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587524629] [2020-11-11 23:17:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:17:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:17:46,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587524629] [2020-11-11 23:17:46,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:17:46,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:17:46,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83249087] [2020-11-11 23:17:46,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:17:46,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:17:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:17:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:17:46,665 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:17:46,751 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2020-11-11 23:17:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:17:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2020-11-11 23:17:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:17:46,752 INFO L225 Difference]: With dead ends: 100 [2020-11-11 23:17:46,752 INFO L226 Difference]: Without dead ends: 53 [2020-11-11 23:17:46,753 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-11 23:17:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-11 23:17:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-11-11 23:17:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 52 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2020-11-11 23:17:46,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26 [2020-11-11 23:17:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:17:46,755 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions. [2020-11-11 23:17:46,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:17:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2020-11-11 23:17:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-11 23:17:46,756 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:17:46,756 INFO L494 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] [2020-11-11 23:17:46,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 23:17:46,757 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:17:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:17:46,757 INFO L82 PathProgramCache]: Analyzing trace with hash -38529952, now seen corresponding path program 2 times [2020-11-11 23:17:46,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:17:46,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978003235] [2020-11-11 23:17:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:17:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:17:46,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:17:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:17:46,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:17:46,968 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 23:17:46,968 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 23:17:46,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 23:17:47,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:17:47 BasicIcfg [2020-11-11 23:17:47,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 23:17:47,138 INFO L168 Benchmark]: Toolchain (without parser) took 19581.67 ms. Allocated memory was 302.0 MB in the beginning and 471.9 MB in the end (delta: 169.9 MB). Free memory was 277.1 MB in the beginning and 177.7 MB in the end (delta: 99.3 MB). Peak memory consumption was 272.0 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,138 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 23:17:47,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.94 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 282.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.57 ms. Allocated memory is still 302.0 MB. Free memory was 282.1 MB in the beginning and 279.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,140 INFO L168 Benchmark]: Boogie Preprocessor took 58.39 ms. Allocated memory is still 302.0 MB. Free memory was 279.8 MB in the beginning and 277.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,141 INFO L168 Benchmark]: RCFGBuilder took 2555.88 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 276.7 MB in the beginning and 332.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 174.2 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,141 INFO L168 Benchmark]: TraceAbstraction took 15883.71 ms. Allocated memory was 373.3 MB in the beginning and 471.9 MB in the end (delta: 98.6 MB). Free memory was 332.2 MB in the beginning and 177.7 MB in the end (delta: 154.4 MB). Peak memory consumption was 253.0 MB. Max. memory is 16.0 GB. [2020-11-11 23:17:47,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 945.94 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 282.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 125.57 ms. Allocated memory is still 302.0 MB. Free memory was 282.1 MB in the beginning and 279.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.39 ms. Allocated memory is still 302.0 MB. Free memory was 279.8 MB in the beginning and 277.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2555.88 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 276.7 MB in the beginning and 332.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 174.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15883.71 ms. Allocated memory was 373.3 MB in the beginning and 471.9 MB in the end (delta: 98.6 MB). Free memory was 332.2 MB in the beginning and 177.7 MB in the end (delta: 154.4 MB). Peak memory consumption was 253.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1839 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 220 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.1s, 131 PlacesBefore, 45 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2712 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 6772 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t997; [L857] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t998; [L859] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t999; [L861] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t1000; [L863] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix037_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 470 SDtfs, 538 SDslu, 1055 SDs, 0 SdLazy, 354 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 273 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 14145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...