./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix032_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/pthread-wmm/mix032_power.opt.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 9cbe5d5e4b1ca845148e08aa16ab839dac62635b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 18:11:50,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:50,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:50,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:50,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:50,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:50,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:50,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:50,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:50,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:50,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:50,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:50,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:50,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:50,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:50,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:50,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:50,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:50,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:50,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:50,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:50,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:50,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:50,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:50,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:50,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:50,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:50,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:50,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:50,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:50,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:50,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:50,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:50,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:50,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:50,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:50,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:50,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:50,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:50,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:50,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:50,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:11:50,968 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:50,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:50,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:50,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:50,974 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:50,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:50,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:50,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:50,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:50,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:50,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:50,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:50,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:50,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:50,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:50,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:50,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:50,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:50,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:50,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:50,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:50,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:50,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:50,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:50,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:50,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:50,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:50,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:50,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:50,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 9cbe5d5e4b1ca845148e08aa16ab839dac62635b [2019-11-28 18:11:51,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:51,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:51,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:51,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:51,322 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:51,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix032_power.opt.i [2019-11-28 18:11:51,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5304ac011/e64879e23598470bb025af0d7eabc293/FLAG4a3d4128e [2019-11-28 18:11:51,961 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:51,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032_power.opt.i [2019-11-28 18:11:51,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5304ac011/e64879e23598470bb025af0d7eabc293/FLAG4a3d4128e [2019-11-28 18:11:52,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5304ac011/e64879e23598470bb025af0d7eabc293 [2019-11-28 18:11:52,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:52,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:52,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:52,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:52,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:52,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:52" (1/1) ... [2019-11-28 18:11:52,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652b0c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:52, skipping insertion in model container [2019-11-28 18:11:52,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:52" (1/1) ... [2019-11-28 18:11:52,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:52,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:52,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:52,838 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:52,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:53,001 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:53,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53 WrapperNode [2019-11-28 18:11:53,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:53,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:53,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:53,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:53,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:53,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:53,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:53,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:53,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (1/1) ... [2019-11-28 18:11:53,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:53,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:53,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:53,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:53,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (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-11-28 18:11:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:11:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:11:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:53,192 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:11:53,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:53,857 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:53,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:53 BoogieIcfgContainer [2019-11-28 18:11:53,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:53,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:53,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:53,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:53,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:52" (1/3) ... [2019-11-28 18:11:53,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195eb7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:53, skipping insertion in model container [2019-11-28 18:11:53,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:53" (2/3) ... [2019-11-28 18:11:53,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195eb7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:53, skipping insertion in model container [2019-11-28 18:11:53,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:53" (3/3) ... [2019-11-28 18:11:53,868 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-11-28 18:11:53,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:53,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:53,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:53,890 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:53,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,930 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,930 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,965 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,965 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:53,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:11:54,014 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:54,015 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:54,015 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:54,015 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:54,016 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:54,016 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:54,016 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:54,016 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:54,035 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-11-28 18:11:54,037 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-11-28 18:11:54,126 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-11-28 18:11:54,126 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:54,142 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:11:54,164 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-11-28 18:11:54,232 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-11-28 18:11:54,232 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:54,240 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:11:54,259 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:11:54,261 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:58,214 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 18:11:58,514 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:58,655 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:59,006 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-28 18:11:59,133 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 18:11:59,157 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-11-28 18:11:59,157 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:11:59,161 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-11-28 18:12:00,368 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-11-28 18:12:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-11-28 18:12:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:00,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:00,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:00,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-11-28 18:12:00,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:00,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381532330] [2019-11-28 18:12:00,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:00,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381532330] [2019-11-28 18:12:00,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:00,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:00,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247961827] [2019-11-28 18:12:00,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:00,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:00,701 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-11-28 18:12:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:01,154 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-11-28 18:12:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:01,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:01,315 INFO L225 Difference]: With dead ends: 14182 [2019-11-28 18:12:01,316 INFO L226 Difference]: Without dead ends: 13350 [2019-11-28 18:12:01,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-11-28 18:12:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-11-28 18:12:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-11-28 18:12:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-11-28 18:12:02,160 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-11-28 18:12:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:02,161 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-11-28 18:12:02,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-11-28 18:12:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:02,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:02,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:02,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-11-28 18:12:02,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:02,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825709227] [2019-11-28 18:12:02,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:02,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825709227] [2019-11-28 18:12:02,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:02,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:02,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419746807] [2019-11-28 18:12:02,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:02,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:02,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:02,323 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 4 states. [2019-11-28 18:12:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:02,893 INFO L93 Difference]: Finished difference Result 20194 states and 75632 transitions. [2019-11-28 18:12:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:02,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:02,996 INFO L225 Difference]: With dead ends: 20194 [2019-11-28 18:12:02,997 INFO L226 Difference]: Without dead ends: 20164 [2019-11-28 18:12:02,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-11-28 18:12:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18344. [2019-11-28 18:12:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-11-28 18:12:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 69695 transitions. [2019-11-28 18:12:04,019 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 69695 transitions. Word has length 13 [2019-11-28 18:12:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:04,020 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 69695 transitions. [2019-11-28 18:12:04,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 69695 transitions. [2019-11-28 18:12:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:04,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:04,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:04,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-11-28 18:12:04,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:04,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041248560] [2019-11-28 18:12:04,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:04,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041248560] [2019-11-28 18:12:04,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:04,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:04,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736948039] [2019-11-28 18:12:04,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:04,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:04,091 INFO L87 Difference]: Start difference. First operand 18344 states and 69695 transitions. Second operand 3 states. [2019-11-28 18:12:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:04,274 INFO L93 Difference]: Finished difference Result 23466 states and 87296 transitions. [2019-11-28 18:12:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:04,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:04,404 INFO L225 Difference]: With dead ends: 23466 [2019-11-28 18:12:04,405 INFO L226 Difference]: Without dead ends: 23466 [2019-11-28 18:12:04,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23466 states. [2019-11-28 18:12:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 20060. [2019-11-28 18:12:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20060 states. [2019-11-28 18:12:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 75793 transitions. [2019-11-28 18:12:05,120 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 75793 transitions. Word has length 16 [2019-11-28 18:12:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:05,121 INFO L462 AbstractCegarLoop]: Abstraction has 20060 states and 75793 transitions. [2019-11-28 18:12:05,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 75793 transitions. [2019-11-28 18:12:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:05,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:05,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:05,128 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-11-28 18:12:05,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:05,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228383765] [2019-11-28 18:12:05,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:05,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228383765] [2019-11-28 18:12:05,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:05,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:05,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457271319] [2019-11-28 18:12:05,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:05,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:05,194 INFO L87 Difference]: Start difference. First operand 20060 states and 75793 transitions. Second operand 4 states. [2019-11-28 18:12:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:05,483 INFO L93 Difference]: Finished difference Result 24056 states and 89213 transitions. [2019-11-28 18:12:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:05,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:06,053 INFO L225 Difference]: With dead ends: 24056 [2019-11-28 18:12:06,054 INFO L226 Difference]: Without dead ends: 24036 [2019-11-28 18:12:06,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2019-11-28 18:12:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21018. [2019-11-28 18:12:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21018 states. [2019-11-28 18:12:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 79114 transitions. [2019-11-28 18:12:06,760 INFO L78 Accepts]: Start accepts. Automaton has 21018 states and 79114 transitions. Word has length 16 [2019-11-28 18:12:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:06,761 INFO L462 AbstractCegarLoop]: Abstraction has 21018 states and 79114 transitions. [2019-11-28 18:12:06,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 21018 states and 79114 transitions. [2019-11-28 18:12:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:06,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:06,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:06,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:06,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-11-28 18:12:06,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:06,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291802496] [2019-11-28 18:12:06,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:06,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291802496] [2019-11-28 18:12:06,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:06,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:06,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937804122] [2019-11-28 18:12:06,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:06,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:06,829 INFO L87 Difference]: Start difference. First operand 21018 states and 79114 transitions. Second operand 4 states. [2019-11-28 18:12:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:07,114 INFO L93 Difference]: Finished difference Result 26444 states and 98339 transitions. [2019-11-28 18:12:07,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:07,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:07,206 INFO L225 Difference]: With dead ends: 26444 [2019-11-28 18:12:07,206 INFO L226 Difference]: Without dead ends: 26414 [2019-11-28 18:12:07,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26414 states. [2019-11-28 18:12:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26414 to 21928. [2019-11-28 18:12:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21928 states. [2019-11-28 18:12:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 82711 transitions. [2019-11-28 18:12:08,542 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 82711 transitions. Word has length 16 [2019-11-28 18:12:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,542 INFO L462 AbstractCegarLoop]: Abstraction has 21928 states and 82711 transitions. [2019-11-28 18:12:08,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 82711 transitions. [2019-11-28 18:12:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:08,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:08,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2076093569, now seen corresponding path program 1 times [2019-11-28 18:12:08,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872200821] [2019-11-28 18:12:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:08,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872200821] [2019-11-28 18:12:08,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:08,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:08,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876380669] [2019-11-28 18:12:08,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:08,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:08,652 INFO L87 Difference]: Start difference. First operand 21928 states and 82711 transitions. Second operand 3 states. [2019-11-28 18:12:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:08,794 INFO L93 Difference]: Finished difference Result 20766 states and 77222 transitions. [2019-11-28 18:12:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:08,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,850 INFO L225 Difference]: With dead ends: 20766 [2019-11-28 18:12:08,851 INFO L226 Difference]: Without dead ends: 20766 [2019-11-28 18:12:08,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-11-28 18:12:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20282. [2019-11-28 18:12:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-11-28 18:12:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 75572 transitions. [2019-11-28 18:12:09,373 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 75572 transitions. Word has length 18 [2019-11-28 18:12:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:09,373 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 75572 transitions. [2019-11-28 18:12:09,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 75572 transitions. [2019-11-28 18:12:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:09,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:09,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:09,383 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1546230613, now seen corresponding path program 1 times [2019-11-28 18:12:09,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:09,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556239384] [2019-11-28 18:12:09,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:09,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556239384] [2019-11-28 18:12:09,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:09,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:09,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154104670] [2019-11-28 18:12:09,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:09,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:09,484 INFO L87 Difference]: Start difference. First operand 20282 states and 75572 transitions. Second operand 3 states. [2019-11-28 18:12:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:09,604 INFO L93 Difference]: Finished difference Result 20378 states and 75774 transitions. [2019-11-28 18:12:09,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:09,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:09,653 INFO L225 Difference]: With dead ends: 20378 [2019-11-28 18:12:09,653 INFO L226 Difference]: Without dead ends: 20378 [2019-11-28 18:12:09,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20378 states. [2019-11-28 18:12:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20378 to 20279. [2019-11-28 18:12:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-11-28 18:12:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 75560 transitions. [2019-11-28 18:12:10,111 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 75560 transitions. Word has length 18 [2019-11-28 18:12:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,112 INFO L462 AbstractCegarLoop]: Abstraction has 20279 states and 75560 transitions. [2019-11-28 18:12:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 75560 transitions. [2019-11-28 18:12:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:12:10,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:10,121 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 876364753, now seen corresponding path program 1 times [2019-11-28 18:12:10,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622942218] [2019-11-28 18:12:10,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:10,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622942218] [2019-11-28 18:12:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:10,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6307349] [2019-11-28 18:12:10,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:10,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:10,214 INFO L87 Difference]: Start difference. First operand 20279 states and 75560 transitions. Second operand 4 states. [2019-11-28 18:12:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,897 INFO L93 Difference]: Finished difference Result 19992 states and 74483 transitions. [2019-11-28 18:12:10,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:10,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:12:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,947 INFO L225 Difference]: With dead ends: 19992 [2019-11-28 18:12:10,947 INFO L226 Difference]: Without dead ends: 19992 [2019-11-28 18:12:10,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2019-11-28 18:12:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 19992. [2019-11-28 18:12:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-11-28 18:12:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 74483 transitions. [2019-11-28 18:12:11,363 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 74483 transitions. Word has length 19 [2019-11-28 18:12:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:11,363 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 74483 transitions. [2019-11-28 18:12:11,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 74483 transitions. [2019-11-28 18:12:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:12:11,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:11,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:11,375 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1090694034, now seen corresponding path program 1 times [2019-11-28 18:12:11,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:11,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429350067] [2019-11-28 18:12:11,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:11,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429350067] [2019-11-28 18:12:11,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:11,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:11,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085543073] [2019-11-28 18:12:11,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:11,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:11,418 INFO L87 Difference]: Start difference. First operand 19992 states and 74483 transitions. Second operand 3 states. [2019-11-28 18:12:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:11,479 INFO L93 Difference]: Finished difference Result 11527 states and 37443 transitions. [2019-11-28 18:12:11,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:11,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:12:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:11,500 INFO L225 Difference]: With dead ends: 11527 [2019-11-28 18:12:11,500 INFO L226 Difference]: Without dead ends: 11527 [2019-11-28 18:12:11,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11527 states. [2019-11-28 18:12:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11527 to 11527. [2019-11-28 18:12:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11527 states. [2019-11-28 18:12:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11527 states to 11527 states and 37443 transitions. [2019-11-28 18:12:11,722 INFO L78 Accepts]: Start accepts. Automaton has 11527 states and 37443 transitions. Word has length 20 [2019-11-28 18:12:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:11,722 INFO L462 AbstractCegarLoop]: Abstraction has 11527 states and 37443 transitions. [2019-11-28 18:12:11,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11527 states and 37443 transitions. [2019-11-28 18:12:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:12:11,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:11,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:11,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash -586691094, now seen corresponding path program 1 times [2019-11-28 18:12:11,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:11,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022561085] [2019-11-28 18:12:11,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:11,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022561085] [2019-11-28 18:12:11,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:11,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:11,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488003271] [2019-11-28 18:12:11,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:11,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:11,823 INFO L87 Difference]: Start difference. First operand 11527 states and 37443 transitions. Second operand 4 states. [2019-11-28 18:12:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:11,905 INFO L93 Difference]: Finished difference Result 11551 states and 37451 transitions. [2019-11-28 18:12:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:11,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-28 18:12:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:11,932 INFO L225 Difference]: With dead ends: 11551 [2019-11-28 18:12:11,932 INFO L226 Difference]: Without dead ends: 11551 [2019-11-28 18:12:11,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11551 states. [2019-11-28 18:12:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11551 to 11502. [2019-11-28 18:12:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-11-28 18:12:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 37369 transitions. [2019-11-28 18:12:12,254 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 37369 transitions. Word has length 21 [2019-11-28 18:12:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,254 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 37369 transitions. [2019-11-28 18:12:12,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 37369 transitions. [2019-11-28 18:12:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:12:12,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:12,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1095736327, now seen corresponding path program 1 times [2019-11-28 18:12:12,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323516271] [2019-11-28 18:12:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:12,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323516271] [2019-11-28 18:12:12,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:12,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:12,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598923605] [2019-11-28 18:12:12,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:12,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:12,344 INFO L87 Difference]: Start difference. First operand 11502 states and 37369 transitions. Second operand 5 states. [2019-11-28 18:12:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:12,486 INFO L93 Difference]: Finished difference Result 17709 states and 57631 transitions. [2019-11-28 18:12:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:12,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 18:12:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:12,511 INFO L225 Difference]: With dead ends: 17709 [2019-11-28 18:12:12,512 INFO L226 Difference]: Without dead ends: 9001 [2019-11-28 18:12:12,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2019-11-28 18:12:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 8952. [2019-11-28 18:12:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8952 states. [2019-11-28 18:12:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 28931 transitions. [2019-11-28 18:12:12,707 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 28931 transitions. Word has length 22 [2019-11-28 18:12:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,707 INFO L462 AbstractCegarLoop]: Abstraction has 8952 states and 28931 transitions. [2019-11-28 18:12:12,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 28931 transitions. [2019-11-28 18:12:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:12:12,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:12,712 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,712 INFO L82 PathProgramCache]: Analyzing trace with hash -38213151, now seen corresponding path program 2 times [2019-11-28 18:12:12,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889038357] [2019-11-28 18:12:12,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:12,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889038357] [2019-11-28 18:12:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446822418] [2019-11-28 18:12:12,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:12,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:12,757 INFO L87 Difference]: Start difference. First operand 8952 states and 28931 transitions. Second operand 4 states. [2019-11-28 18:12:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:12,787 INFO L93 Difference]: Finished difference Result 2139 states and 5647 transitions. [2019-11-28 18:12:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:12,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-28 18:12:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:12,791 INFO L225 Difference]: With dead ends: 2139 [2019-11-28 18:12:12,792 INFO L226 Difference]: Without dead ends: 2139 [2019-11-28 18:12:12,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-11-28 18:12:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-11-28 18:12:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-11-28 18:12:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 5647 transitions. [2019-11-28 18:12:12,827 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 5647 transitions. Word has length 22 [2019-11-28 18:12:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,828 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 5647 transitions. [2019-11-28 18:12:12,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 5647 transitions. [2019-11-28 18:12:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:12,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:12,839 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-11-28 18:12:12,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215887388] [2019-11-28 18:12:12,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:12,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215887388] [2019-11-28 18:12:12,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:12,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:12,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744418558] [2019-11-28 18:12:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:12,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:12,923 INFO L87 Difference]: Start difference. First operand 2139 states and 5647 transitions. Second operand 5 states. [2019-11-28 18:12:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,096 INFO L93 Difference]: Finished difference Result 2884 states and 7387 transitions. [2019-11-28 18:12:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:13,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,101 INFO L225 Difference]: With dead ends: 2884 [2019-11-28 18:12:13,101 INFO L226 Difference]: Without dead ends: 2818 [2019-11-28 18:12:13,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-28 18:12:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2193. [2019-11-28 18:12:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-11-28 18:12:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5754 transitions. [2019-11-28 18:12:13,130 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5754 transitions. Word has length 29 [2019-11-28 18:12:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:13,131 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 5754 transitions. [2019-11-28 18:12:13,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5754 transitions. [2019-11-28 18:12:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:13,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:13,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:13,135 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1377421728, now seen corresponding path program 1 times [2019-11-28 18:12:13,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:13,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101300528] [2019-11-28 18:12:13,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:13,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101300528] [2019-11-28 18:12:13,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:13,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:13,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780841209] [2019-11-28 18:12:13,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:13,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:13,176 INFO L87 Difference]: Start difference. First operand 2193 states and 5754 transitions. Second operand 3 states. [2019-11-28 18:12:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,220 INFO L93 Difference]: Finished difference Result 2593 states and 6438 transitions. [2019-11-28 18:12:13,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:13,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:12:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,225 INFO L225 Difference]: With dead ends: 2593 [2019-11-28 18:12:13,225 INFO L226 Difference]: Without dead ends: 2593 [2019-11-28 18:12:13,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-11-28 18:12:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2157. [2019-11-28 18:12:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-11-28 18:12:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 5350 transitions. [2019-11-28 18:12:13,480 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 5350 transitions. Word has length 29 [2019-11-28 18:12:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:13,480 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 5350 transitions. [2019-11-28 18:12:13,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 5350 transitions. [2019-11-28 18:12:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:12:13,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:13,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:13,485 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -834134890, now seen corresponding path program 1 times [2019-11-28 18:12:13,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875441735] [2019-11-28 18:12:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:13,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875441735] [2019-11-28 18:12:13,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:13,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:13,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478832399] [2019-11-28 18:12:13,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:13,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:13,566 INFO L87 Difference]: Start difference. First operand 2157 states and 5350 transitions. Second operand 5 states. [2019-11-28 18:12:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,793 INFO L93 Difference]: Finished difference Result 2648 states and 6508 transitions. [2019-11-28 18:12:13,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:13,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:12:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,800 INFO L225 Difference]: With dead ends: 2648 [2019-11-28 18:12:13,800 INFO L226 Difference]: Without dead ends: 2565 [2019-11-28 18:12:13,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-11-28 18:12:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2031. [2019-11-28 18:12:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-11-28 18:12:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 5056 transitions. [2019-11-28 18:12:13,850 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 5056 transitions. Word has length 30 [2019-11-28 18:12:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:13,851 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 5056 transitions. [2019-11-28 18:12:13,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 5056 transitions. [2019-11-28 18:12:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:12:13,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:13,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:13,857 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1660300154, now seen corresponding path program 1 times [2019-11-28 18:12:13,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:13,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164494420] [2019-11-28 18:12:13,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:13,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164494420] [2019-11-28 18:12:13,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:13,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:13,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761189154] [2019-11-28 18:12:13,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:13,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:13,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:13,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:13,971 INFO L87 Difference]: Start difference. First operand 2031 states and 5056 transitions. Second operand 5 states. [2019-11-28 18:12:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:14,008 INFO L93 Difference]: Finished difference Result 1223 states and 3152 transitions. [2019-11-28 18:12:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:14,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:12:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:14,011 INFO L225 Difference]: With dead ends: 1223 [2019-11-28 18:12:14,011 INFO L226 Difference]: Without dead ends: 1223 [2019-11-28 18:12:14,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-11-28 18:12:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2019-11-28 18:12:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-28 18:12:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3152 transitions. [2019-11-28 18:12:14,029 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3152 transitions. Word has length 31 [2019-11-28 18:12:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:14,029 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3152 transitions. [2019-11-28 18:12:14,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3152 transitions. [2019-11-28 18:12:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:14,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:14,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:14,033 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 204691235, now seen corresponding path program 1 times [2019-11-28 18:12:14,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860612213] [2019-11-28 18:12:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:14,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860612213] [2019-11-28 18:12:14,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:14,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:14,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321516542] [2019-11-28 18:12:14,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:14,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:14,172 INFO L87 Difference]: Start difference. First operand 1223 states and 3152 transitions. Second operand 7 states. [2019-11-28 18:12:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:14,465 INFO L93 Difference]: Finished difference Result 3339 states and 8535 transitions. [2019-11-28 18:12:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:14,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:12:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:14,470 INFO L225 Difference]: With dead ends: 3339 [2019-11-28 18:12:14,471 INFO L226 Difference]: Without dead ends: 2759 [2019-11-28 18:12:14,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-11-28 18:12:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1655. [2019-11-28 18:12:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-28 18:12:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4144 transitions. [2019-11-28 18:12:14,509 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 4144 transitions. Word has length 45 [2019-11-28 18:12:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:14,510 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 4144 transitions. [2019-11-28 18:12:14,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 4144 transitions. [2019-11-28 18:12:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:14,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:14,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:14,513 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -162970969, now seen corresponding path program 2 times [2019-11-28 18:12:14,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:14,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527364376] [2019-11-28 18:12:14,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:14,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527364376] [2019-11-28 18:12:14,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:14,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:12:14,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126591052] [2019-11-28 18:12:14,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:12:14,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:12:14,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:12:14,665 INFO L87 Difference]: Start difference. First operand 1655 states and 4144 transitions. Second operand 8 states. [2019-11-28 18:12:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:14,976 INFO L93 Difference]: Finished difference Result 2867 states and 7016 transitions. [2019-11-28 18:12:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:12:14,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 18:12:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:14,981 INFO L225 Difference]: With dead ends: 2867 [2019-11-28 18:12:14,981 INFO L226 Difference]: Without dead ends: 2223 [2019-11-28 18:12:14,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:12:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-11-28 18:12:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1375. [2019-11-28 18:12:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-11-28 18:12:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3521 transitions. [2019-11-28 18:12:15,009 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 3521 transitions. Word has length 45 [2019-11-28 18:12:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:15,009 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 3521 transitions. [2019-11-28 18:12:15,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:12:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 3521 transitions. [2019-11-28 18:12:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:15,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:15,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:15,013 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 3 times [2019-11-28 18:12:15,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:15,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43986429] [2019-11-28 18:12:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:15,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:15,124 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:15,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_25|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_36| 4) |v_#length_25|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36| 1) |v_#valid_72|) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_36|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36|) |v_ULTIMATE.start_main_~#t852~0.offset_25| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_25|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-11-28 18:12:15,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-11-28 18:12:15,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-11-28 18:12:15,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_Out344317822 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out344317822 256))) (not (= (mod ~z$w_buff0_used~0_Out344317822 256) 0)))) 1 0)) (= |P2Thread1of1ForFork0_#in~arg.base_In344317822| P2Thread1of1ForFork0_~arg.base_Out344317822) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822|) (= ~z$w_buff1_used~0_Out344317822 ~z$w_buff0_used~0_In344317822) (= ~z$w_buff1~0_Out344317822 ~z$w_buff0~0_In344317822) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822 0)) (= |P2Thread1of1ForFork0_#in~arg.offset_In344317822| P2Thread1of1ForFork0_~arg.offset_Out344317822) (= 1 ~z$w_buff0~0_Out344317822)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In344317822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In344317822, ~z$w_buff0~0=~z$w_buff0~0_In344317822, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In344317822|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out344317822, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In344317822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out344317822, ~z$w_buff0~0=~z$w_buff0~0_Out344317822, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out344317822, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out344317822, ~z$w_buff1~0=~z$w_buff1~0_Out344317822, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In344317822|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:12:15,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:12:15,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1340679911 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1340679911 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1340679911 |P2Thread1of1ForFork0_#t~ite28_Out1340679911|)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1340679911| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1340679911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1340679911} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1340679911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1340679911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1340679911} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:15,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In695683056 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In695683056 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In695683056 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In695683056 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite29_Out695683056| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In695683056 |P2Thread1of1ForFork0_#t~ite29_Out695683056|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In695683056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In695683056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out695683056|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:15,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1028743295 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1028743295 256))) (.cse2 (= ~z$r_buff0_thd3~0_In1028743295 ~z$r_buff0_thd3~0_Out1028743295))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out1028743295) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028743295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1028743295, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1028743295|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-11-28 18:12:15,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In282342386 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In282342386 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In282342386 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In282342386 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite31_Out282342386| ~z$r_buff1_thd3~0_In282342386) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite31_Out282342386| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In282342386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In282342386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In282342386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In282342386} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In282342386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In282342386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In282342386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In282342386, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out282342386|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:15,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:12:15,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:15,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:12:15,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:15,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1993494908 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1993494908 256) 0))) (or (and (= ~z~0_In-1993494908 |ULTIMATE.start_main_#t~ite35_Out-1993494908|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1993494908 |ULTIMATE.start_main_#t~ite35_Out-1993494908|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$w_buff1~0=~z$w_buff1~0_In-1993494908, ~z~0=~z~0_In-1993494908} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1993494908, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1993494908|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$w_buff1~0=~z$w_buff1~0_In-1993494908, ~z~0=~z~0_In-1993494908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:15,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:15,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In486092144 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In486092144 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out486092144| ~z$w_buff0_used~0_In486092144) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out486092144| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486092144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486092144} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486092144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486092144, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out486092144|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:15,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1065128433 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1065128433 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1065128433 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1065128433 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1065128433|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1065128433 |ULTIMATE.start_main_#t~ite38_Out1065128433|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1065128433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1065128433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1065128433} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1065128433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1065128433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1065128433, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1065128433|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:15,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In9992610 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In9992610 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out9992610|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In9992610 |ULTIMATE.start_main_#t~ite39_Out9992610|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out9992610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:15,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In275918280 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In275918280 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In275918280 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In275918280 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out275918280| ~z$r_buff1_thd0~0_In275918280) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out275918280|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275918280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275918280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In275918280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275918280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275918280, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out275918280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275918280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In275918280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275918280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:15,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:15,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:15 BasicIcfg [2019-11-28 18:12:15,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:15,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:15,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:15,259 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:15,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:53" (3/4) ... [2019-11-28 18:12:15,263 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:15,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_25|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_36| 4) |v_#length_25|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36| 1) |v_#valid_72|) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_36|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36|) |v_ULTIMATE.start_main_~#t852~0.offset_25| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_25|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-11-28 18:12:15,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-11-28 18:12:15,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-11-28 18:12:15,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_Out344317822 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out344317822 256))) (not (= (mod ~z$w_buff0_used~0_Out344317822 256) 0)))) 1 0)) (= |P2Thread1of1ForFork0_#in~arg.base_In344317822| P2Thread1of1ForFork0_~arg.base_Out344317822) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822|) (= ~z$w_buff1_used~0_Out344317822 ~z$w_buff0_used~0_In344317822) (= ~z$w_buff1~0_Out344317822 ~z$w_buff0~0_In344317822) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822 0)) (= |P2Thread1of1ForFork0_#in~arg.offset_In344317822| P2Thread1of1ForFork0_~arg.offset_Out344317822) (= 1 ~z$w_buff0~0_Out344317822)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In344317822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In344317822, ~z$w_buff0~0=~z$w_buff0~0_In344317822, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In344317822|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out344317822, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out344317822|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In344317822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out344317822, ~z$w_buff0~0=~z$w_buff0~0_Out344317822, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out344317822, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out344317822, ~z$w_buff1~0=~z$w_buff1~0_Out344317822, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In344317822|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out344317822} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:12:15,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:12:15,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1340679911 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1340679911 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1340679911 |P2Thread1of1ForFork0_#t~ite28_Out1340679911|)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1340679911| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1340679911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1340679911} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1340679911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1340679911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1340679911} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:15,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In695683056 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In695683056 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In695683056 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In695683056 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite29_Out695683056| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In695683056 |P2Thread1of1ForFork0_#t~ite29_Out695683056|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In695683056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In695683056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out695683056|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:15,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1028743295 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1028743295 256))) (.cse2 (= ~z$r_buff0_thd3~0_In1028743295 ~z$r_buff0_thd3~0_Out1028743295))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd3~0_Out1028743295) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028743295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1028743295, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1028743295|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-11-28 18:12:15,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In282342386 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In282342386 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In282342386 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In282342386 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite31_Out282342386| ~z$r_buff1_thd3~0_In282342386) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite31_Out282342386| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In282342386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In282342386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In282342386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In282342386} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In282342386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In282342386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In282342386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In282342386, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out282342386|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:15,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-11-28 18:12:15,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:15,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-11-28 18:12:15,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:15,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1993494908 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1993494908 256) 0))) (or (and (= ~z~0_In-1993494908 |ULTIMATE.start_main_#t~ite35_Out-1993494908|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1993494908 |ULTIMATE.start_main_#t~ite35_Out-1993494908|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$w_buff1~0=~z$w_buff1~0_In-1993494908, ~z~0=~z~0_In-1993494908} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1993494908, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1993494908|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$w_buff1~0=~z$w_buff1~0_In-1993494908, ~z~0=~z~0_In-1993494908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:15,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:15,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In486092144 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In486092144 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out486092144| ~z$w_buff0_used~0_In486092144) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out486092144| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486092144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486092144} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In486092144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486092144, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out486092144|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:15,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1065128433 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1065128433 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1065128433 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1065128433 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1065128433|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1065128433 |ULTIMATE.start_main_#t~ite38_Out1065128433|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1065128433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1065128433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1065128433} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1065128433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1065128433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1065128433, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1065128433|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:15,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In9992610 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In9992610 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out9992610|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In9992610 |ULTIMATE.start_main_#t~ite39_Out9992610|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out9992610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:15,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In275918280 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In275918280 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In275918280 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In275918280 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out275918280| ~z$r_buff1_thd0~0_In275918280) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out275918280|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275918280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275918280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In275918280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275918280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275918280, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out275918280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275918280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In275918280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275918280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:15,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:15,387 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:15,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:15,389 INFO L168 Benchmark]: Toolchain (without parser) took 23145.87 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 960.4 MB in the beginning and 1.7 GB in the end (delta: -749.1 MB). Peak memory consumption was 759.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,390 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:15,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.20 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,392 INFO L168 Benchmark]: Boogie Preprocessor took 37.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:15,392 INFO L168 Benchmark]: RCFGBuilder took 745.23 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,395 INFO L168 Benchmark]: TraceAbstraction took 21398.76 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -665.8 MB). Peak memory consumption was 688.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,396 INFO L168 Benchmark]: Witness Printer took 128.84 ms. Allocated memory is still 2.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:15,398 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.20 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.21 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 745.23 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: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21398.76 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -665.8 MB). Peak memory consumption was 688.4 MB. Max. memory is 11.5 GB. * Witness Printer took 128.84 ms. Allocated memory is still 2.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2314 SDtfs, 2010 SDslu, 4133 SDs, 0 SdLazy, 1191 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21928occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 16958 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 69171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...