/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:02:21,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:02:21,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:02:21,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:02:21,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:02:21,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:02:21,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:02:21,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:02:21,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:02:21,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:02:21,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:02:21,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:02:21,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:02:21,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:02:21,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:02:21,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:02:21,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:02:21,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:02:21,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:02:21,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:02:21,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:02:21,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:02:21,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:02:21,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:02:21,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:02:21,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:02:21,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:02:21,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:02:21,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:02:21,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:02:21,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:02:21,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:02:21,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:02:21,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:02:21,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:02:21,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:02:21,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:02:21,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:02:21,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:02:21,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:02:21,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:02:21,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:02:21,205 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:02:21,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:02:21,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:02:21,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:02:21,209 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:02:21,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:02:21,210 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:02:21,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:02:21,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:02:21,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:02:21,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:02:21,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:02:21,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:02:21,213 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:02:21,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:02:21,213 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:02:21,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:02:21,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:02:21,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:02:21,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:02:21,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:02:21,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:02:21,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:02:21,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:02:21,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:02:21,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:02:21,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:02:21,216 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:02:21,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:02:21,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:02:21,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:02:21,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:02:21,584 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:02:21,585 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:02:21,586 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-16 12:02:21,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2f4bb090/e4b54b1d9ba6429f969cd567eb27777f/FLAG9d49a837b [2020-10-16 12:02:22,325 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:02:22,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-16 12:02:22,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2f4bb090/e4b54b1d9ba6429f969cd567eb27777f/FLAG9d49a837b [2020-10-16 12:02:22,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f2f4bb090/e4b54b1d9ba6429f969cd567eb27777f [2020-10-16 12:02:22,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:02:22,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:02:22,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:22,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:02:22,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:02:22,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:22" (1/1) ... [2020-10-16 12:02:22,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fad9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:22, skipping insertion in model container [2020-10-16 12:02:22,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:22" (1/1) ... [2020-10-16 12:02:22,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:02:22,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:02:23,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:23,225 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:02:23,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:23,456 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:02:23,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23 WrapperNode [2020-10-16 12:02:23,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:23,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:23,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:02:23,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:02:23,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:23,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:02:23,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:02:23,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:02:23,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... [2020-10-16 12:02:23,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:02:23,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:02:23,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:02:23,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:02:23,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:02:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:02:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:02:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:02:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:02:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:02:23,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:02:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:02:23,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:02:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:02:23,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:02:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:02:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:02:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:02:23,665 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:02:25,832 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:02:25,832 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:02:25,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:25 BoogieIcfgContainer [2020-10-16 12:02:25,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:02:25,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:02:25,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:02:25,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:02:25,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:22" (1/3) ... [2020-10-16 12:02:25,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145581cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:25, skipping insertion in model container [2020-10-16 12:02:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:23" (2/3) ... [2020-10-16 12:02:25,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145581cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:25, skipping insertion in model container [2020-10-16 12:02:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:25" (3/3) ... [2020-10-16 12:02:25,846 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2020-10-16 12:02:25,862 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:02:25,862 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:02:25,870 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:02:25,871 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:02:25,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,907 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,910 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,910 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,911 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,911 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,914 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,914 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,920 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,921 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,932 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:25,933 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:02:25,947 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:02:25,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:02:25,971 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:02:25,971 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:02:25,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:02:25,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:02:25,971 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:02:25,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:02:25,972 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:02:25,987 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:02:25,988 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-10-16 12:02:25,991 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2020-10-16 12:02:25,993 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 12:02:26,043 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 12:02:26,043 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:02:26,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 12:02:26,052 INFO L117 LiptonReduction]: Number of co-enabled transitions 1806 [2020-10-16 12:02:26,826 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:02:26,949 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:02:27,241 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:02:27,368 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:02:29,076 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:02:29,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:02:29,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:29,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:02:29,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:30,074 WARN L193 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 12:02:30,914 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 12:02:31,235 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:02:32,760 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-16 12:02:33,204 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:02:33,476 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-10-16 12:02:33,591 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-16 12:02:33,733 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 12:02:33,857 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 12:02:33,865 INFO L132 LiptonReduction]: Checked pairs total: 5073 [2020-10-16 12:02:33,865 INFO L134 LiptonReduction]: Total number of compositions: 81 [2020-10-16 12:02:33,872 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-16 12:02:33,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-16 12:02:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-16 12:02:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:02:33,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:33,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:02:33,960 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1016740632, now seen corresponding path program 1 times [2020-10-16 12:02:33,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:33,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018061489] [2020-10-16 12:02:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:34,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018061489] [2020-10-16 12:02:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:34,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347497878] [2020-10-16 12:02:34,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:34,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:34,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:34,235 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-16 12:02:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,348 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-16 12:02:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:34,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:02:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,377 INFO L225 Difference]: With dead ends: 812 [2020-10-16 12:02:34,378 INFO L226 Difference]: Without dead ends: 662 [2020-10-16 12:02:34,379 INFO L677 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-10-16 12:02:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-16 12:02:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-16 12:02:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-16 12:02:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-16 12:02:34,506 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2020-10-16 12:02:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,507 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-16 12:02:34,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-16 12:02:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:02:34,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:34,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:02:34,510 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1534838499, now seen corresponding path program 1 times [2020-10-16 12:02:34,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106896719] [2020-10-16 12:02:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:34,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106896719] [2020-10-16 12:02:34,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:34,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:02:34,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999950284] [2020-10-16 12:02:34,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:34,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:34,730 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 4 states. [2020-10-16 12:02:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,782 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-16 12:02:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:34,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-16 12:02:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,789 INFO L225 Difference]: With dead ends: 612 [2020-10-16 12:02:34,789 INFO L226 Difference]: Without dead ends: 612 [2020-10-16 12:02:34,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-16 12:02:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-16 12:02:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-16 12:02:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-16 12:02:34,815 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9 [2020-10-16 12:02:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,816 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-16 12:02:34,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-16 12:02:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:02:34,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:34,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:02:34,819 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1839780204, now seen corresponding path program 1 times [2020-10-16 12:02:34,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079881880] [2020-10-16 12:02:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:34,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079881880] [2020-10-16 12:02:34,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:34,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:34,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730841064] [2020-10-16 12:02:34,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:34,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:34,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:34,926 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 3 states. [2020-10-16 12:02:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,962 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-10-16 12:02:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:34,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:02:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,969 INFO L225 Difference]: With dead ends: 604 [2020-10-16 12:02:34,969 INFO L226 Difference]: Without dead ends: 604 [2020-10-16 12:02:34,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-16 12:02:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-16 12:02:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-16 12:02:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-10-16 12:02:34,990 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2020-10-16 12:02:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,991 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-10-16 12:02:34,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-10-16 12:02:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:02:34,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:34,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:02:34,995 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1198612647, now seen corresponding path program 1 times [2020-10-16 12:02:34,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570656218] [2020-10-16 12:02:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:35,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570656218] [2020-10-16 12:02:35,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:35,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:35,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171111632] [2020-10-16 12:02:35,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:35,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:35,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:35,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:35,156 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-10-16 12:02:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:35,287 INFO L93 Difference]: Finished difference Result 620 states and 1894 transitions. [2020-10-16 12:02:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:35,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:02:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:35,294 INFO L225 Difference]: With dead ends: 620 [2020-10-16 12:02:35,363 INFO L226 Difference]: Without dead ends: 620 [2020-10-16 12:02:35,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-10-16 12:02:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2020-10-16 12:02:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-10-16 12:02:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions. [2020-10-16 12:02:35,390 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12 [2020-10-16 12:02:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:35,390 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions. [2020-10-16 12:02:35,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions. [2020-10-16 12:02:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:02:35,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:35,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:35,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:02:35,397 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:35,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:35,397 INFO L82 PathProgramCache]: Analyzing trace with hash 507284654, now seen corresponding path program 1 times [2020-10-16 12:02:35,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:35,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918693578] [2020-10-16 12:02:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:35,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918693578] [2020-10-16 12:02:35,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:35,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:35,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625187336] [2020-10-16 12:02:35,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:35,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:35,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:35,479 INFO L87 Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand 5 states. [2020-10-16 12:02:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:35,557 INFO L93 Difference]: Finished difference Result 618 states and 1884 transitions. [2020-10-16 12:02:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:35,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:02:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:35,563 INFO L225 Difference]: With dead ends: 618 [2020-10-16 12:02:35,563 INFO L226 Difference]: Without dead ends: 618 [2020-10-16 12:02:35,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-16 12:02:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608. [2020-10-16 12:02:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-10-16 12:02:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions. [2020-10-16 12:02:35,584 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13 [2020-10-16 12:02:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:35,584 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions. [2020-10-16 12:02:35,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions. [2020-10-16 12:02:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:35,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:35,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:35,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:02:35,587 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:35,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1454046081, now seen corresponding path program 1 times [2020-10-16 12:02:35,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:35,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215062140] [2020-10-16 12:02:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:35,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215062140] [2020-10-16 12:02:35,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:35,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:35,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380604382] [2020-10-16 12:02:35,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:35,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:35,704 INFO L87 Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand 6 states. [2020-10-16 12:02:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:35,886 INFO L93 Difference]: Finished difference Result 702 states and 2130 transitions. [2020-10-16 12:02:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:35,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:02:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:35,892 INFO L225 Difference]: With dead ends: 702 [2020-10-16 12:02:35,892 INFO L226 Difference]: Without dead ends: 702 [2020-10-16 12:02:35,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2020-10-16 12:02:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 696. [2020-10-16 12:02:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-10-16 12:02:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2111 transitions. [2020-10-16 12:02:35,915 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2111 transitions. Word has length 14 [2020-10-16 12:02:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:35,916 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 2111 transitions. [2020-10-16 12:02:35,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2111 transitions. [2020-10-16 12:02:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:35,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:35,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:35,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:02:35,919 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:35,919 INFO L82 PathProgramCache]: Analyzing trace with hash -815913744, now seen corresponding path program 1 times [2020-10-16 12:02:35,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:35,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359301001] [2020-10-16 12:02:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359301001] [2020-10-16 12:02:36,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:36,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052684675] [2020-10-16 12:02:36,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:36,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:36,044 INFO L87 Difference]: Start difference. First operand 696 states and 2111 transitions. Second operand 6 states. [2020-10-16 12:02:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:36,129 INFO L93 Difference]: Finished difference Result 688 states and 2083 transitions. [2020-10-16 12:02:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:36,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:02:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:36,135 INFO L225 Difference]: With dead ends: 688 [2020-10-16 12:02:36,136 INFO L226 Difference]: Without dead ends: 688 [2020-10-16 12:02:36,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-10-16 12:02:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2020-10-16 12:02:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-10-16 12:02:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2083 transitions. [2020-10-16 12:02:36,160 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 2083 transitions. Word has length 14 [2020-10-16 12:02:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:36,161 INFO L481 AbstractCegarLoop]: Abstraction has 688 states and 2083 transitions. [2020-10-16 12:02:36,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 2083 transitions. [2020-10-16 12:02:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:36,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:36,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:36,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:02:36,164 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -815576712, now seen corresponding path program 1 times [2020-10-16 12:02:36,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:36,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621400788] [2020-10-16 12:02:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621400788] [2020-10-16 12:02:36,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:36,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661893812] [2020-10-16 12:02:36,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:36,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:36,230 INFO L87 Difference]: Start difference. First operand 688 states and 2083 transitions. Second operand 6 states. [2020-10-16 12:02:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:36,312 INFO L93 Difference]: Finished difference Result 961 states and 2859 transitions. [2020-10-16 12:02:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:02:36,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:02:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:36,318 INFO L225 Difference]: With dead ends: 961 [2020-10-16 12:02:36,318 INFO L226 Difference]: Without dead ends: 664 [2020-10-16 12:02:36,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2020-10-16 12:02:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 634. [2020-10-16 12:02:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-10-16 12:02:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1807 transitions. [2020-10-16 12:02:36,339 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1807 transitions. Word has length 14 [2020-10-16 12:02:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:36,340 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 1807 transitions. [2020-10-16 12:02:36,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1807 transitions. [2020-10-16 12:02:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:36,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:36,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:36,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:02:36,342 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1074690156, now seen corresponding path program 2 times [2020-10-16 12:02:36,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:36,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657941983] [2020-10-16 12:02:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657941983] [2020-10-16 12:02:36,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:36,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077003763] [2020-10-16 12:02:36,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:36,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:36,427 INFO L87 Difference]: Start difference. First operand 634 states and 1807 transitions. Second operand 4 states. [2020-10-16 12:02:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:36,465 INFO L93 Difference]: Finished difference Result 602 states and 1516 transitions. [2020-10-16 12:02:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:36,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:02:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:36,469 INFO L225 Difference]: With dead ends: 602 [2020-10-16 12:02:36,469 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 12:02:36,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 12:02:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 12:02:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 12:02:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1055 transitions. [2020-10-16 12:02:36,482 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1055 transitions. Word has length 14 [2020-10-16 12:02:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:36,483 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1055 transitions. [2020-10-16 12:02:36,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1055 transitions. [2020-10-16 12:02:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:02:36,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:36,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:36,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:02:36,485 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1537330800, now seen corresponding path program 1 times [2020-10-16 12:02:36,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:36,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817870070] [2020-10-16 12:02:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817870070] [2020-10-16 12:02:36,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:36,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909925943] [2020-10-16 12:02:36,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:36,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:36,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:36,572 INFO L87 Difference]: Start difference. First operand 434 states and 1055 transitions. Second operand 5 states. [2020-10-16 12:02:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:36,619 INFO L93 Difference]: Finished difference Result 353 states and 800 transitions. [2020-10-16 12:02:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:36,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:02:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:36,622 INFO L225 Difference]: With dead ends: 353 [2020-10-16 12:02:36,622 INFO L226 Difference]: Without dead ends: 275 [2020-10-16 12:02:36,622 INFO L677 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-10-16 12:02:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-16 12:02:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 245. [2020-10-16 12:02:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-16 12:02:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 547 transitions. [2020-10-16 12:02:36,630 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 547 transitions. Word has length 15 [2020-10-16 12:02:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:36,630 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 547 transitions. [2020-10-16 12:02:36,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 547 transitions. [2020-10-16 12:02:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:02:36,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:36,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:36,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:02:36,632 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:36,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1971831814, now seen corresponding path program 1 times [2020-10-16 12:02:36,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:36,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918566241] [2020-10-16 12:02:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918566241] [2020-10-16 12:02:36,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:36,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259681787] [2020-10-16 12:02:36,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:36,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:36,736 INFO L87 Difference]: Start difference. First operand 245 states and 547 transitions. Second operand 6 states. [2020-10-16 12:02:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:36,790 INFO L93 Difference]: Finished difference Result 224 states and 504 transitions. [2020-10-16 12:02:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:02:36,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 12:02:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:36,792 INFO L225 Difference]: With dead ends: 224 [2020-10-16 12:02:36,792 INFO L226 Difference]: Without dead ends: 165 [2020-10-16 12:02:36,793 INFO L677 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-10-16 12:02:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-16 12:02:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-10-16 12:02:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-16 12:02:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 378 transitions. [2020-10-16 12:02:36,799 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 378 transitions. Word has length 18 [2020-10-16 12:02:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:36,799 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 378 transitions. [2020-10-16 12:02:36,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 378 transitions. [2020-10-16 12:02:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:02:36,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:36,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:36,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:02:36,801 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash 802352378, now seen corresponding path program 1 times [2020-10-16 12:02:36,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:36,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215642117] [2020-10-16 12:02:36,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:36,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215642117] [2020-10-16 12:02:36,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:36,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:02:36,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273109583] [2020-10-16 12:02:36,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:02:36,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:02:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:36,966 INFO L87 Difference]: Start difference. First operand 165 states and 378 transitions. Second operand 9 states. [2020-10-16 12:02:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:37,133 INFO L93 Difference]: Finished difference Result 247 states and 525 transitions. [2020-10-16 12:02:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 12:02:37,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-16 12:02:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:37,135 INFO L225 Difference]: With dead ends: 247 [2020-10-16 12:02:37,136 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 12:02:37,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:02:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 12:02:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2020-10-16 12:02:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-16 12:02:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 178 transitions. [2020-10-16 12:02:37,139 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 178 transitions. Word has length 22 [2020-10-16 12:02:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:37,140 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 178 transitions. [2020-10-16 12:02:37,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:02:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 178 transitions. [2020-10-16 12:02:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:02:37,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:37,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:37,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:02:37,141 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash -136938758, now seen corresponding path program 2 times [2020-10-16 12:02:37,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:37,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601688164] [2020-10-16 12:02:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:37,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601688164] [2020-10-16 12:02:37,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:37,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:37,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032352621] [2020-10-16 12:02:37,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:37,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:37,197 INFO L87 Difference]: Start difference. First operand 93 states and 178 transitions. Second operand 4 states. [2020-10-16 12:02:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:37,213 INFO L93 Difference]: Finished difference Result 107 states and 197 transitions. [2020-10-16 12:02:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:37,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-16 12:02:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:37,215 INFO L225 Difference]: With dead ends: 107 [2020-10-16 12:02:37,215 INFO L226 Difference]: Without dead ends: 73 [2020-10-16 12:02:37,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-16 12:02:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-16 12:02:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-16 12:02:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 138 transitions. [2020-10-16 12:02:37,219 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 138 transitions. Word has length 22 [2020-10-16 12:02:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:37,219 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 138 transitions. [2020-10-16 12:02:37,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 138 transitions. [2020-10-16 12:02:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:02:37,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:37,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:37,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:02:37,221 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1527193722, now seen corresponding path program 3 times [2020-10-16 12:02:37,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:37,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568202460] [2020-10-16 12:02:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:37,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568202460] [2020-10-16 12:02:37,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:37,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:37,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504833284] [2020-10-16 12:02:37,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:37,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:37,379 INFO L87 Difference]: Start difference. First operand 73 states and 138 transitions. Second operand 7 states. [2020-10-16 12:02:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:37,482 INFO L93 Difference]: Finished difference Result 99 states and 186 transitions. [2020-10-16 12:02:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:37,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 12:02:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:37,483 INFO L225 Difference]: With dead ends: 99 [2020-10-16 12:02:37,484 INFO L226 Difference]: Without dead ends: 77 [2020-10-16 12:02:37,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-16 12:02:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2020-10-16 12:02:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-16 12:02:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2020-10-16 12:02:37,487 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 22 [2020-10-16 12:02:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:37,487 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2020-10-16 12:02:37,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2020-10-16 12:02:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:02:37,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:37,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:37,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:02:37,488 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:37,489 INFO L82 PathProgramCache]: Analyzing trace with hash -258932388, now seen corresponding path program 4 times [2020-10-16 12:02:37,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:37,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380402093] [2020-10-16 12:02:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:02:37,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380402093] [2020-10-16 12:02:37,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:37,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:02:37,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177663153] [2020-10-16 12:02:37,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:02:37,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:02:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:37,671 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand 8 states. [2020-10-16 12:02:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:37,784 INFO L93 Difference]: Finished difference Result 85 states and 149 transitions. [2020-10-16 12:02:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:37,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 12:02:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:37,785 INFO L225 Difference]: With dead ends: 85 [2020-10-16 12:02:37,785 INFO L226 Difference]: Without dead ends: 51 [2020-10-16 12:02:37,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:02:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-16 12:02:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-16 12:02:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-16 12:02:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-16 12:02:37,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-16 12:02:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:37,789 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-16 12:02:37,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:02:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-16 12:02:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:02:37,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:37,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:37,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:02:37,790 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash 813652538, now seen corresponding path program 5 times [2020-10-16 12:02:37,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:37,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289911962] [2020-10-16 12:02:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:37,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:37,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:37,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:02:37,907 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:02:37,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:02:37,908 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:02:37,924 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L2-->L835: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In897674584 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In897674584 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In897674584 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In897674584 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In897674584| ULTIMATE.start_assume_abort_if_not_~cond_Out897674584) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out897674584 0)) (and .cse2 (= ~x$w_buff0_used~0_In897674584 ~x$w_buff0_used~0_Out897674584))) (or (and .cse0 .cse1 (= ~x~0_Out897674584 ~x$w_buff0~0_In897674584)) (and .cse2 (or (and (= ~x~0_In897674584 ~x~0_Out897674584) .cse3) (and .cse4 (= ~x$w_buff1~0_In897674584 ~x~0_Out897674584) .cse5)))) (= ~x$r_buff1_thd0~0_In897674584 ~x$r_buff1_thd0~0_Out897674584) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out897674584 0)) (or (and .cse4 .cse5 (= ~x$w_buff1_used~0_Out897674584 0)) (and (= ~x$w_buff1_used~0_Out897674584 ~x$w_buff1_used~0_In897674584) .cse3)) (= ~x$r_buff0_thd0~0_In897674584 ~x$r_buff0_thd0~0_Out897674584)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In897674584, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In897674584, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In897674584|, ~x$w_buff1~0=~x$w_buff1~0_In897674584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In897674584, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In897674584, ~x~0=~x~0_In897674584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In897674584} OutVars{~x$w_buff0~0=~x$w_buff0~0_In897674584, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out897674584, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out897674584|, ~x$w_buff1~0=~x$w_buff1~0_In897674584, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out897674584|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out897674584, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out897674584|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out897674584|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out897674584|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out897674584, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out897674584, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out897674584|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In897674584|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out897674584, ~x~0=~x~0_Out897674584} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:02:37,931 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,932 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,933 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,933 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,934 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,934 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,935 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,935 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,936 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,936 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,936 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,937 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,937 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,939 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,939 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,940 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,943 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:37,943 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:02:37,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:38,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:38 BasicIcfg [2020-10-16 12:02:38,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:02:38,037 INFO L168 Benchmark]: Toolchain (without parser) took 15437.42 ms. Allocated memory was 144.2 MB in the beginning and 363.3 MB in the end (delta: 219.2 MB). Free memory was 101.5 MB in the beginning and 146.3 MB in the end (delta: -44.8 MB). Peak memory consumption was 174.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,038 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 144.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:02:38,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.59 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 101.1 MB in the beginning and 154.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 151.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,042 INFO L168 Benchmark]: Boogie Preprocessor took 52.05 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,046 INFO L168 Benchmark]: RCFGBuilder took 2255.03 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 148.9 MB in the beginning and 171.5 MB in the end (delta: -22.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,046 INFO L168 Benchmark]: TraceAbstraction took 12197.48 ms. Allocated memory was 248.0 MB in the beginning and 363.3 MB in the end (delta: 115.3 MB). Free memory was 171.5 MB in the beginning and 146.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:38,051 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 144.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.59 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 101.1 MB in the beginning and 154.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 151.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.05 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2255.03 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 148.9 MB in the beginning and 171.5 MB in the end (delta: -22.6 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12197.48 ms. Allocated memory was 248.0 MB in the beginning and 363.3 MB in the end (delta: 115.3 MB). Free memory was 171.5 MB in the beginning and 146.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 941 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 88 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.8s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 27 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 5073 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L711] 0 _Bool x$flush_delayed; [L712] 0 int x$mem_tmp; [L713] 0 _Bool x$r_buff0_thd0; [L714] 0 _Bool x$r_buff0_thd1; [L715] 0 _Bool x$r_buff0_thd2; [L716] 0 _Bool x$r_buff0_thd3; [L717] 0 _Bool x$r_buff1_thd0; [L718] 0 _Bool x$r_buff1_thd1; [L719] 0 _Bool x$r_buff1_thd2; [L720] 0 _Bool x$r_buff1_thd3; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L819] 0 pthread_t t1019; [L820] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] 0 pthread_t t1020; [L822] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] 0 pthread_t t1021; [L824] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L765] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L788] 3 z = 1 [L791] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L736] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 x$flush_delayed = weak$$choice2 [L840] 0 x$mem_tmp = x [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L849] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L849] 0 x = x$flush_delayed ? x$mem_tmp : x [L850] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 392 SDtfs, 526 SDslu, 845 SDs, 0 SdLazy, 456 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 107 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 30068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...