./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad3f78977fb69cd2f99ad06c218209d75543485 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:43:40,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:43:40,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:43:40,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:43:40,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:43:40,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:43:40,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:43:40,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:43:40,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:43:40,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:43:40,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:43:40,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:43:40,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:43:40,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:43:40,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:43:40,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:43:40,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:43:40,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:43:40,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:43:40,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:43:40,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:43:40,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:43:40,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:43:40,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:43:40,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:43:40,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:43:40,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:43:40,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:43:40,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:43:40,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:43:40,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:43:40,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:43:40,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:43:40,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:43:40,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:43:40,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:43:40,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:43:40,989 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:43:40,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:43:40,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:43:40,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:43:40,992 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:43:40,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:43:40,992 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:43:40,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:43:40,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:43:40,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:43:40,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:43:40,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:43:40,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:43:40,994 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:43:40,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:43:40,994 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:43:40,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:43:40,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:43:40,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:43:40,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:43:40,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:43:40,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:43:40,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:43:40,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:43:40,997 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:43:40,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:43:40,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:43:40,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:43:40,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ad3f78977fb69cd2f99ad06c218209d75543485 [2019-01-01 00:43:41,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:43:41,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:43:41,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:43:41,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:43:41,060 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:43:41,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2019-01-01 00:43:41,132 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf5e5beb/93705d634cf94fdfa480b66750853e70/FLAGcded084ae [2019-01-01 00:43:41,697 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:43:41,697 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2019-01-01 00:43:41,718 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf5e5beb/93705d634cf94fdfa480b66750853e70/FLAGcded084ae [2019-01-01 00:43:41,965 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf5e5beb/93705d634cf94fdfa480b66750853e70 [2019-01-01 00:43:41,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:43:41,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:43:41,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:43:41,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:43:41,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:43:41,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:43:41" (1/1) ... [2019-01-01 00:43:41,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57855c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:41, skipping insertion in model container [2019-01-01 00:43:41,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:43:41" (1/1) ... [2019-01-01 00:43:41,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:43:42,075 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:43:42,635 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:43:42,661 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:43:42,895 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:43:43,010 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:43:43,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43 WrapperNode [2019-01-01 00:43:43,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:43:43,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:43:43,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:43:43,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:43:43,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:43:43,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:43:43,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:43:43,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:43:43,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... [2019-01-01 00:43:43,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:43:43,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:43:43,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:43:43,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:43:43,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:43:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:43:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:43:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:43:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:43:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:43:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:43:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:43:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:43:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:43:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:43:43,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:43:43,227 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:43:44,257 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:43:44,258 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:43:44,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:44 BoogieIcfgContainer [2019-01-01 00:43:44,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:43:44,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:43:44,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:43:44,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:43:44,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:43:41" (1/3) ... [2019-01-01 00:43:44,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:43:44, skipping insertion in model container [2019-01-01 00:43:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:43:43" (2/3) ... [2019-01-01 00:43:44,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:43:44, skipping insertion in model container [2019-01-01 00:43:44,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:44" (3/3) ... [2019-01-01 00:43:44,270 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc_false-unreach-call.i [2019-01-01 00:43:44,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,319 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,324 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,353 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,356 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,356 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,356 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,356 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,362 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:43:44,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:43:44,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:43:44,391 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:43:44,409 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:43:44,435 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:43:44,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:43:44,436 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:43:44,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:43:44,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:43:44,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:43:44,438 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:43:44,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:43:44,438 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:43:44,457 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129places, 161 transitions [2019-01-01 00:43:46,513 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-01-01 00:43:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-01-01 00:43:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 00:43:46,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:46,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:46,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:46,544 INFO L82 PathProgramCache]: Analyzing trace with hash -743892383, now seen corresponding path program 1 times [2019-01-01 00:43:46,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:46,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:46,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:46,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:46,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:46,931 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-01-01 00:43:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:47,912 INFO L93 Difference]: Finished difference Result 47765 states and 183116 transitions. [2019-01-01 00:43:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:43:47,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-01 00:43:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:48,276 INFO L225 Difference]: With dead ends: 47765 [2019-01-01 00:43:48,276 INFO L226 Difference]: Without dead ends: 34605 [2019-01-01 00:43:48,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2019-01-01 00:43:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 21753. [2019-01-01 00:43:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-01-01 00:43:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-01-01 00:43:49,887 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-01-01 00:43:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:49,888 INFO L480 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-01-01 00:43:49,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-01-01 00:43:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 00:43:49,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:49,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:49,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash 243022970, now seen corresponding path program 1 times [2019-01-01 00:43:49,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:49,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:49,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:50,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:50,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:50,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:50,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:50,068 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 4 states. [2019-01-01 00:43:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:50,471 INFO L93 Difference]: Finished difference Result 7167 states and 23623 transitions. [2019-01-01 00:43:50,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:43:50,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-01 00:43:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:50,517 INFO L225 Difference]: With dead ends: 7167 [2019-01-01 00:43:50,517 INFO L226 Difference]: Without dead ends: 6321 [2019-01-01 00:43:50,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2019-01-01 00:43:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2019-01-01 00:43:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2019-01-01 00:43:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 20695 transitions. [2019-01-01 00:43:50,725 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 20695 transitions. Word has length 44 [2019-01-01 00:43:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:50,726 INFO L480 AbstractCegarLoop]: Abstraction has 6321 states and 20695 transitions. [2019-01-01 00:43:50,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 20695 transitions. [2019-01-01 00:43:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 00:43:50,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:50,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:50,732 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1181250622, now seen corresponding path program 1 times [2019-01-01 00:43:50,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:50,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:43:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:43:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:43:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:50,926 INFO L87 Difference]: Start difference. First operand 6321 states and 20695 transitions. Second operand 5 states. [2019-01-01 00:43:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:52,420 INFO L93 Difference]: Finished difference Result 12017 states and 38781 transitions. [2019-01-01 00:43:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:52,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-01 00:43:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:52,465 INFO L225 Difference]: With dead ends: 12017 [2019-01-01 00:43:52,466 INFO L226 Difference]: Without dead ends: 11942 [2019-01-01 00:43:52,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:43:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2019-01-01 00:43:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 8286. [2019-01-01 00:43:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2019-01-01 00:43:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 26548 transitions. [2019-01-01 00:43:52,703 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 26548 transitions. Word has length 45 [2019-01-01 00:43:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:52,705 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 26548 transitions. [2019-01-01 00:43:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:43:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 26548 transitions. [2019-01-01 00:43:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 00:43:52,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:52,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:52,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2101913052, now seen corresponding path program 1 times [2019-01-01 00:43:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:52,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:52,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:43:52,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:43:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:43:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:43:52,782 INFO L87 Difference]: Start difference. First operand 8286 states and 26548 transitions. Second operand 3 states. [2019-01-01 00:43:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:52,883 INFO L93 Difference]: Finished difference Result 10982 states and 34703 transitions. [2019-01-01 00:43:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:43:52,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-01 00:43:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:52,920 INFO L225 Difference]: With dead ends: 10982 [2019-01-01 00:43:52,920 INFO L226 Difference]: Without dead ends: 10978 [2019-01-01 00:43:52,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:43:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10978 states. [2019-01-01 00:43:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10978 to 8504. [2019-01-01 00:43:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2019-01-01 00:43:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 26984 transitions. [2019-01-01 00:43:53,144 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 26984 transitions. Word has length 47 [2019-01-01 00:43:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:53,144 INFO L480 AbstractCegarLoop]: Abstraction has 8504 states and 26984 transitions. [2019-01-01 00:43:53,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:43:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 26984 transitions. [2019-01-01 00:43:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 00:43:53,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:53,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:53,148 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash -585625105, now seen corresponding path program 1 times [2019-01-01 00:43:53,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:53,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:53,336 INFO L87 Difference]: Start difference. First operand 8504 states and 26984 transitions. Second operand 6 states. [2019-01-01 00:43:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:54,039 INFO L93 Difference]: Finished difference Result 11920 states and 37195 transitions. [2019-01-01 00:43:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:43:54,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-01-01 00:43:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:54,074 INFO L225 Difference]: With dead ends: 11920 [2019-01-01 00:43:54,074 INFO L226 Difference]: Without dead ends: 11823 [2019-01-01 00:43:54,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:43:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2019-01-01 00:43:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9278. [2019-01-01 00:43:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2019-01-01 00:43:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 29428 transitions. [2019-01-01 00:43:54,311 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 29428 transitions. Word has length 51 [2019-01-01 00:43:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:54,312 INFO L480 AbstractCegarLoop]: Abstraction has 9278 states and 29428 transitions. [2019-01-01 00:43:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 29428 transitions. [2019-01-01 00:43:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 00:43:54,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:54,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:54,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:54,323 INFO L82 PathProgramCache]: Analyzing trace with hash 807716739, now seen corresponding path program 1 times [2019-01-01 00:43:54,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:54,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:54,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:43:54,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:43:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:43:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:43:54,497 INFO L87 Difference]: Start difference. First operand 9278 states and 29428 transitions. Second operand 5 states. [2019-01-01 00:43:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:54,627 INFO L93 Difference]: Finished difference Result 2586 states and 6693 transitions. [2019-01-01 00:43:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:43:54,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-01-01 00:43:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:54,635 INFO L225 Difference]: With dead ends: 2586 [2019-01-01 00:43:54,636 INFO L226 Difference]: Without dead ends: 2138 [2019-01-01 00:43:54,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-01-01 00:43:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2125. [2019-01-01 00:43:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-01 00:43:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5339 transitions. [2019-01-01 00:43:54,890 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5339 transitions. Word has length 61 [2019-01-01 00:43:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:54,891 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 5339 transitions. [2019-01-01 00:43:54,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:43:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5339 transitions. [2019-01-01 00:43:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:54,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:54,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:54,910 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 429549496, now seen corresponding path program 1 times [2019-01-01 00:43:54,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:43:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:43:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:43:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:55,091 INFO L87 Difference]: Start difference. First operand 2125 states and 5339 transitions. Second operand 4 states. [2019-01-01 00:43:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:55,472 INFO L93 Difference]: Finished difference Result 2907 states and 7134 transitions. [2019-01-01 00:43:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:43:55,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:43:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:55,477 INFO L225 Difference]: With dead ends: 2907 [2019-01-01 00:43:55,478 INFO L226 Difference]: Without dead ends: 2907 [2019-01-01 00:43:55,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:43:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2019-01-01 00:43:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2488. [2019-01-01 00:43:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-01-01 00:43:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6155 transitions. [2019-01-01 00:43:55,523 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6155 transitions. Word has length 80 [2019-01-01 00:43:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:55,523 INFO L480 AbstractCegarLoop]: Abstraction has 2488 states and 6155 transitions. [2019-01-01 00:43:55,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:43:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6155 transitions. [2019-01-01 00:43:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:55,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:55,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:55,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:55,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1647659847, now seen corresponding path program 1 times [2019-01-01 00:43:55,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:55,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:56,131 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-01 00:43:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:56,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:56,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:56,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:56,145 INFO L87 Difference]: Start difference. First operand 2488 states and 6155 transitions. Second operand 6 states. [2019-01-01 00:43:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:57,007 INFO L93 Difference]: Finished difference Result 2571 states and 6195 transitions. [2019-01-01 00:43:57,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:43:57,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:57,012 INFO L225 Difference]: With dead ends: 2571 [2019-01-01 00:43:57,013 INFO L226 Difference]: Without dead ends: 2571 [2019-01-01 00:43:57,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:43:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-01-01 00:43:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2339. [2019-01-01 00:43:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2019-01-01 00:43:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 5602 transitions. [2019-01-01 00:43:57,052 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 5602 transitions. Word has length 80 [2019-01-01 00:43:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:57,053 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 5602 transitions. [2019-01-01 00:43:57,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 5602 transitions. [2019-01-01 00:43:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:57,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:57,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:57,060 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 542886051, now seen corresponding path program 1 times [2019-01-01 00:43:57,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:57,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:57,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:57,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:57,332 INFO L87 Difference]: Start difference. First operand 2339 states and 5602 transitions. Second operand 6 states. [2019-01-01 00:43:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:58,106 INFO L93 Difference]: Finished difference Result 3002 states and 7052 transitions. [2019-01-01 00:43:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:58,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:58,112 INFO L225 Difference]: With dead ends: 3002 [2019-01-01 00:43:58,112 INFO L226 Difference]: Without dead ends: 2927 [2019-01-01 00:43:58,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-01-01 00:43:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2682. [2019-01-01 00:43:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-01 00:43:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6364 transitions. [2019-01-01 00:43:58,158 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6364 transitions. Word has length 80 [2019-01-01 00:43:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:58,158 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 6364 transitions. [2019-01-01 00:43:58,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6364 transitions. [2019-01-01 00:43:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:58,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:58,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:58,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1411213254, now seen corresponding path program 2 times [2019-01-01 00:43:58,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:58,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:58,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:43:58,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:43:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:43:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:58,437 INFO L87 Difference]: Start difference. First operand 2682 states and 6364 transitions. Second operand 7 states. [2019-01-01 00:43:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:59,178 INFO L93 Difference]: Finished difference Result 3229 states and 7678 transitions. [2019-01-01 00:43:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:43:59,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-01-01 00:43:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:59,184 INFO L225 Difference]: With dead ends: 3229 [2019-01-01 00:43:59,184 INFO L226 Difference]: Without dead ends: 3229 [2019-01-01 00:43:59,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:43:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2019-01-01 00:43:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2712. [2019-01-01 00:43:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2019-01-01 00:43:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 6470 transitions. [2019-01-01 00:43:59,225 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 6470 transitions. Word has length 80 [2019-01-01 00:43:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:59,225 INFO L480 AbstractCegarLoop]: Abstraction has 2712 states and 6470 transitions. [2019-01-01 00:43:59,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:43:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 6470 transitions. [2019-01-01 00:43:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:59,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:59,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:59,235 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1467217790, now seen corresponding path program 1 times [2019-01-01 00:43:59,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:59,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:59,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:43:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:43:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:43:59,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:43:59,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:43:59,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:43:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:43:59,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:43:59,519 INFO L87 Difference]: Start difference. First operand 2712 states and 6470 transitions. Second operand 6 states. [2019-01-01 00:43:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:43:59,895 INFO L93 Difference]: Finished difference Result 3109 states and 7177 transitions. [2019-01-01 00:43:59,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:43:59,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:43:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:43:59,901 INFO L225 Difference]: With dead ends: 3109 [2019-01-01 00:43:59,902 INFO L226 Difference]: Without dead ends: 3109 [2019-01-01 00:43:59,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:43:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-01-01 00:43:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2796. [2019-01-01 00:43:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2019-01-01 00:43:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 6505 transitions. [2019-01-01 00:43:59,942 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 6505 transitions. Word has length 80 [2019-01-01 00:43:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:43:59,942 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 6505 transitions. [2019-01-01 00:43:59,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:43:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 6505 transitions. [2019-01-01 00:43:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:43:59,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:43:59,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:43:59,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:43:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:43:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1721954335, now seen corresponding path program 1 times [2019-01-01 00:43:59,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:43:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:43:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:43:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:43:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:00,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:00,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:44:00,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:44:00,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:44:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:00,035 INFO L87 Difference]: Start difference. First operand 2796 states and 6505 transitions. Second operand 4 states. [2019-01-01 00:44:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:00,222 INFO L93 Difference]: Finished difference Result 3004 states and 7041 transitions. [2019-01-01 00:44:00,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:44:00,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:44:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:00,228 INFO L225 Difference]: With dead ends: 3004 [2019-01-01 00:44:00,228 INFO L226 Difference]: Without dead ends: 3004 [2019-01-01 00:44:00,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2019-01-01 00:44:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2860. [2019-01-01 00:44:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-01-01 00:44:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 6681 transitions. [2019-01-01 00:44:00,264 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 6681 transitions. Word has length 80 [2019-01-01 00:44:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:00,264 INFO L480 AbstractCegarLoop]: Abstraction has 2860 states and 6681 transitions. [2019-01-01 00:44:00,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:44:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 6681 transitions. [2019-01-01 00:44:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:00,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:00,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:00,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 765558498, now seen corresponding path program 1 times [2019-01-01 00:44:00,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:00,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:00,702 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:44:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:00,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:00,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:00,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:00,912 INFO L87 Difference]: Start difference. First operand 2860 states and 6681 transitions. Second operand 6 states. [2019-01-01 00:44:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:01,062 INFO L93 Difference]: Finished difference Result 2812 states and 6449 transitions. [2019-01-01 00:44:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:44:01,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:44:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:01,066 INFO L225 Difference]: With dead ends: 2812 [2019-01-01 00:44:01,067 INFO L226 Difference]: Without dead ends: 2812 [2019-01-01 00:44:01,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2019-01-01 00:44:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2541. [2019-01-01 00:44:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-01-01 00:44:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 5837 transitions. [2019-01-01 00:44:01,104 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 5837 transitions. Word has length 80 [2019-01-01 00:44:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:01,104 INFO L480 AbstractCegarLoop]: Abstraction has 2541 states and 5837 transitions. [2019-01-01 00:44:01,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 5837 transitions. [2019-01-01 00:44:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:01,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:01,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:01,110 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash -981421532, now seen corresponding path program 1 times [2019-01-01 00:44:01,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:01,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:01,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:01,505 INFO L87 Difference]: Start difference. First operand 2541 states and 5837 transitions. Second operand 6 states. [2019-01-01 00:44:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:01,757 INFO L93 Difference]: Finished difference Result 2927 states and 6650 transitions. [2019-01-01 00:44:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:44:01,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-01 00:44:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:01,762 INFO L225 Difference]: With dead ends: 2927 [2019-01-01 00:44:01,762 INFO L226 Difference]: Without dead ends: 2869 [2019-01-01 00:44:01,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2019-01-01 00:44:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2244. [2019-01-01 00:44:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:44:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5100 transitions. [2019-01-01 00:44:01,800 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5100 transitions. Word has length 82 [2019-01-01 00:44:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:01,800 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5100 transitions. [2019-01-01 00:44:01,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5100 transitions. [2019-01-01 00:44:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:01,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:01,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:01,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:01,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:01,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1236336421, now seen corresponding path program 1 times [2019-01-01 00:44:01,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:01,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:01,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:01,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:44:02,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:44:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:44:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:44:02,007 INFO L87 Difference]: Start difference. First operand 2244 states and 5100 transitions. Second operand 5 states. [2019-01-01 00:44:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:02,083 INFO L93 Difference]: Finished difference Result 2244 states and 5084 transitions. [2019-01-01 00:44:02,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:44:02,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-01-01 00:44:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:02,088 INFO L225 Difference]: With dead ends: 2244 [2019-01-01 00:44:02,088 INFO L226 Difference]: Without dead ends: 2244 [2019-01-01 00:44:02,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2019-01-01 00:44:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2019-01-01 00:44:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:44:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5084 transitions. [2019-01-01 00:44:02,273 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5084 transitions. Word has length 82 [2019-01-01 00:44:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:02,273 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5084 transitions. [2019-01-01 00:44:02,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:44:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5084 transitions. [2019-01-01 00:44:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:02,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:02,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:02,281 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2123840102, now seen corresponding path program 1 times [2019-01-01 00:44:02,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:02,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:02,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:02,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:02,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:02,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:44:02,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:44:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:44:02,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:02,510 INFO L87 Difference]: Start difference. First operand 2244 states and 5084 transitions. Second operand 7 states. [2019-01-01 00:44:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:03,249 INFO L93 Difference]: Finished difference Result 3952 states and 9010 transitions. [2019-01-01 00:44:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:44:03,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-01 00:44:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:03,254 INFO L225 Difference]: With dead ends: 3952 [2019-01-01 00:44:03,254 INFO L226 Difference]: Without dead ends: 1652 [2019-01-01 00:44:03,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:44:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-01-01 00:44:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-01-01 00:44:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-01-01 00:44:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3759 transitions. [2019-01-01 00:44:03,273 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3759 transitions. Word has length 82 [2019-01-01 00:44:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:03,273 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 3759 transitions. [2019-01-01 00:44:03,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:44:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3759 transitions. [2019-01-01 00:44:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:03,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:03,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:03,277 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1980467430, now seen corresponding path program 2 times [2019-01-01 00:44:03,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:03,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:44:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:44:03,358 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:44:03,550 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:44:03,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:44:03 BasicIcfg [2019-01-01 00:44:03,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:44:03,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:44:03,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:44:03,553 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:44:03,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:43:44" (3/4) ... [2019-01-01 00:44:03,558 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:44:03,743 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:44:03,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:44:03,744 INFO L168 Benchmark]: Toolchain (without parser) took 21773.97 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 677.9 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -355.7 MB). Peak memory consumption was 322.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,746 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:44:03,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1037.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,747 INFO L168 Benchmark]: Boogie Preprocessor took 38.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:44:03,749 INFO L168 Benchmark]: RCFGBuilder took 1117.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,751 INFO L168 Benchmark]: TraceAbstraction took 19290.67 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 548.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -277.6 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,752 INFO L168 Benchmark]: Witness Printer took 191.02 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:44:03,761 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1037.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1117.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19290.67 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 548.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -277.6 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. * Witness Printer took 191.02 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L680] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L681] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L682] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L683] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L684] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L685] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0] [L686] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L687] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L688] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L689] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L690] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L691] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L692] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L694] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L695] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L696] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L766] -1 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] FCALL, FORK -1 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L768] -1 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L769] FCALL, FORK -1 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 0 x$w_buff1 = x$w_buff0 [L731] 0 x$w_buff0 = 1 [L732] 0 x$w_buff1_used = x$w_buff0_used [L733] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L736] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L737] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L738] 0 x$r_buff0_thd2 = (_Bool)1 [L741] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L700] 1 y = 2 [L705] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L706] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L707] 1 x$flush_delayed = weak$$choice2 [L708] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L710] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L711] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L712] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L712] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L714] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L715] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x = x$flush_delayed ? x$mem_tmp : x [L718] 1 x$flush_delayed = (_Bool)0 [L723] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 0 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 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L748] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L748] 0 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 [L751] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L779] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. UNSAFE Result, 19.1s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3513 SDtfs, 4214 SDslu, 6399 SDs, 0 SdLazy, 2740 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27853occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 24306 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 211681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...