./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer --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 6ca83ad5e5d2ae3eae2712175e07213bae7d69c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-12-07 12:26:39,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:26:39,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:26:39,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:26:39,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:26:39,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:26:39,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:26:39,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:26:39,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:26:39,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:26:39,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:26:39,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:26:39,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:26:39,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:26:39,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:26:39,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:26:39,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:26:39,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:26:39,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:26:39,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:26:39,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:26:39,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:26:39,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:26:39,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:26:39,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:26:39,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:26:39,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:26:39,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:26:39,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:26:39,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:26:39,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:26:39,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:26:39,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:26:39,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:26:39,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:26:39,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:26:39,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:26:39,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:26:39,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:26:39,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:26:39,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:26:39,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:26:39,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:26:39,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:26:39,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:26:39,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:26:39,814 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:26:39,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:26:39,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:26:39,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:26:39,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:26:39,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:26:39,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:26:39,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:26:39,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:26:39,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:26:39,817 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer 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 -> 6ca83ad5e5d2ae3eae2712175e07213bae7d69c7 [2019-12-07 12:26:39,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:26:39,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:26:39,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:26:39,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:26:39,931 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:26:39,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i [2019-12-07 12:26:39,976 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/data/f9ab69450/121be8ef18dd4fd58b56c96005677bba/FLAG4b015b2c2 [2019-12-07 12:26:40,438 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:26:40,438 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i [2019-12-07 12:26:40,449 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/data/f9ab69450/121be8ef18dd4fd58b56c96005677bba/FLAG4b015b2c2 [2019-12-07 12:26:40,952 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/data/f9ab69450/121be8ef18dd4fd58b56c96005677bba [2019-12-07 12:26:40,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:26:40,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:26:40,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:40,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:26:40,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:26:40,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:40" (1/1) ... [2019-12-07 12:26:40,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f655a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:40, skipping insertion in model container [2019-12-07 12:26:40,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:40" (1/1) ... [2019-12-07 12:26:40,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:26:40,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:26:41,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:41,266 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:26:41,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:41,356 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:26:41,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41 WrapperNode [2019-12-07 12:26:41,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:41,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:41,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:26:41,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:26:41,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:41,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:26:41,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:26:41,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:26:41,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... [2019-12-07 12:26:41,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:26:41,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:26:41,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:26:41,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:26:41,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:26:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:26:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:26:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:26:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:26:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:26:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 12:26:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:26:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:26:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:26:41,481 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:26:41,891 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:26:41,892 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:26:41,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:41 BoogieIcfgContainer [2019-12-07 12:26:41,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:26:41,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:26:41,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:26:41,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:26:41,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:26:40" (1/3) ... [2019-12-07 12:26:41,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f992ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:41, skipping insertion in model container [2019-12-07 12:26:41,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:41" (2/3) ... [2019-12-07 12:26:41,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f992ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:41, skipping insertion in model container [2019-12-07 12:26:41,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:41" (3/3) ... [2019-12-07 12:26:41,897 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_pso.opt.i [2019-12-07 12:26:41,903 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:26:41,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:26:41,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:26:41,909 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:26:41,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,952 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,958 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:26:41,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:26:41,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:26:41,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:26:41,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:26:41,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:26:41,989 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:26:41,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:26:41,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:26:41,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:26:42,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 12:26:42,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 12:26:42,068 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 12:26:42,068 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:26:42,080 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:26:42,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 12:26:42,144 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 12:26:42,144 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:26:42,153 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:26:42,179 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 12:26:42,180 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:26:45,939 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 12:26:46,176 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 12:26:46,289 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 12:26:46,289 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 12:26:46,292 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 12:26:55,196 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 12:26:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 12:26:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:26:55,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:55,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:55,203 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:26:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 12:26:55,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:26:55,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352378056] [2019-12-07 12:26:55,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:55,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352378056] [2019-12-07 12:26:55,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:55,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:26:55,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006832388] [2019-12-07 12:26:55,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:55,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:26:55,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:55,382 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 12:26:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:56,201 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 12:26:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:56,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:26:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:56,739 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 12:26:56,739 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 12:26:56,740 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-12-07 12:26:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 12:26:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 12:26:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 12:27:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 12:27:01,330 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 12:27:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:01,331 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 12:27:01,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 12:27:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:27:01,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:01,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:01,338 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 12:27:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:01,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934781519] [2019-12-07 12:27:01,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:01,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934781519] [2019-12-07 12:27:01,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:01,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:01,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217896458] [2019-12-07 12:27:01,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:01,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:01,401 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 12:27:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:02,299 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 12:27:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:02,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:27:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:02,716 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 12:27:02,717 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 12:27:02,717 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-12-07 12:27:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 12:27:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 12:27:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 12:27:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 12:27:06,753 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 12:27:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:06,754 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 12:27:06,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 12:27:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:27:06,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:06,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:06,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 12:27:06,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:06,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800552600] [2019-12-07 12:27:06,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:06,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800552600] [2019-12-07 12:27:06,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:06,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:06,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459451849] [2019-12-07 12:27:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:06,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:06,812 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 12:27:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:09,475 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 12:27:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:09,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:27:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:09,994 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 12:27:09,994 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 12:27:09,994 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-12-07 12:27:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 12:27:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 12:27:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 12:27:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 12:27:14,441 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 12:27:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 12:27:14,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 12:27:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:27:14,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:14,451 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-12-07 12:27:14,452 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 12:27:14,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:14,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350622552] [2019-12-07 12:27:14,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:14,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-12-07 12:27:14,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350622552] [2019-12-07 12:27:14,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:14,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:14,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697893056] [2019-12-07 12:27:14,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:14,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:14,482 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 12:27:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:16,218 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 12:27:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:16,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:27:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:16,994 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 12:27:16,994 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 12:27:16,994 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-12-07 12:27:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 12:27:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 12:27:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 12:27:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 12:27:25,958 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 12:27:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:25,958 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 12:27:25,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 12:27:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:27:25,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:25,971 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-12-07 12:27:25,971 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 12:27:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:25,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005812638] [2019-12-07 12:27:25,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:26,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005812638] [2019-12-07 12:27:26,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:26,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:26,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829574271] [2019-12-07 12:27:26,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:26,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:26,031 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 12:27:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:27,153 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 12:27:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:27,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:27:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:28,500 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 12:27:28,500 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 12:27:28,501 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-12-07 12:27:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 12:27:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 12:27:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 12:27:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 12:27:37,148 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 12:27:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:37,148 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 12:27:37,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 12:27:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:27:37,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:37,158 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-12-07 12:27:37,158 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 12:27:37,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:37,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850770498] [2019-12-07 12:27:37,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:37,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850770498] [2019-12-07 12:27:37,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:37,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:37,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588840660] [2019-12-07 12:27:37,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:37,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:37,196 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 12:27:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:38,394 INFO L93 Difference]: Finished difference Result 174616 states and 691416 transitions. [2019-12-07 12:27:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:27:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:38,820 INFO L225 Difference]: With dead ends: 174616 [2019-12-07 12:27:38,820 INFO L226 Difference]: Without dead ends: 174616 [2019-12-07 12:27:38,820 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-12-07 12:27:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174616 states. [2019-12-07 12:27:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174616 to 174616. [2019-12-07 12:27:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174616 states. [2019-12-07 12:27:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174616 states to 174616 states and 691416 transitions. [2019-12-07 12:27:43,351 INFO L78 Accepts]: Start accepts. Automaton has 174616 states and 691416 transitions. Word has length 20 [2019-12-07 12:27:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:43,351 INFO L462 AbstractCegarLoop]: Abstraction has 174616 states and 691416 transitions. [2019-12-07 12:27:43,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 174616 states and 691416 transitions. [2019-12-07 12:27:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:27:43,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:43,360 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-12-07 12:27:43,360 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2107811657, now seen corresponding path program 1 times [2019-12-07 12:27:43,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:43,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497758118] [2019-12-07 12:27:43,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:43,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497758118] [2019-12-07 12:27:43,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:43,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:43,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784107918] [2019-12-07 12:27:43,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:43,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:43,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:43,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:43,432 INFO L87 Difference]: Start difference. First operand 174616 states and 691416 transitions. Second operand 4 states. [2019-12-07 12:27:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:45,284 INFO L93 Difference]: Finished difference Result 322087 states and 1264994 transitions. [2019-12-07 12:27:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:27:45,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:27:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:46,130 INFO L225 Difference]: With dead ends: 322087 [2019-12-07 12:27:46,131 INFO L226 Difference]: Without dead ends: 320713 [2019-12-07 12:27:46,131 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-12-07 12:27:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320713 states. [2019-12-07 12:27:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320713 to 315585. [2019-12-07 12:27:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315585 states. [2019-12-07 12:27:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315585 states to 315585 states and 1247228 transitions. [2019-12-07 12:27:56,274 INFO L78 Accepts]: Start accepts. Automaton has 315585 states and 1247228 transitions. Word has length 21 [2019-12-07 12:27:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:56,274 INFO L462 AbstractCegarLoop]: Abstraction has 315585 states and 1247228 transitions. [2019-12-07 12:27:56,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 315585 states and 1247228 transitions. [2019-12-07 12:27:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:27:56,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:56,291 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-12-07 12:27:56,292 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:56,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 12:27:56,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:56,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063884459] [2019-12-07 12:27:56,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:56,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063884459] [2019-12-07 12:27:56,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:56,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:56,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23467856] [2019-12-07 12:27:56,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:56,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:56,332 INFO L87 Difference]: Start difference. First operand 315585 states and 1247228 transitions. Second operand 4 states. [2019-12-07 12:27:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:58,783 INFO L93 Difference]: Finished difference Result 389378 states and 1522547 transitions. [2019-12-07 12:27:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:58,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:27:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:59,807 INFO L225 Difference]: With dead ends: 389378 [2019-12-07 12:27:59,807 INFO L226 Difference]: Without dead ends: 389324 [2019-12-07 12:27:59,807 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-12-07 12:28:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389324 states. [2019-12-07 12:28:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389324 to 319479. [2019-12-07 12:28:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319479 states. [2019-12-07 12:28:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319479 states to 319479 states and 1262524 transitions. [2019-12-07 12:28:12,573 INFO L78 Accepts]: Start accepts. Automaton has 319479 states and 1262524 transitions. Word has length 21 [2019-12-07 12:28:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:12,573 INFO L462 AbstractCegarLoop]: Abstraction has 319479 states and 1262524 transitions. [2019-12-07 12:28:12,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:28:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 319479 states and 1262524 transitions. [2019-12-07 12:28:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:28:12,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:12,593 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-12-07 12:28:12,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1200590819, now seen corresponding path program 1 times [2019-12-07 12:28:12,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:12,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191300050] [2019-12-07 12:28:12,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:12,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191300050] [2019-12-07 12:28:12,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:12,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:28:12,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121619630] [2019-12-07 12:28:12,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:28:12,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:28:12,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:28:12,652 INFO L87 Difference]: Start difference. First operand 319479 states and 1262524 transitions. Second operand 4 states. [2019-12-07 12:28:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:14,122 INFO L93 Difference]: Finished difference Result 311727 states and 1227654 transitions. [2019-12-07 12:28:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:28:14,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 12:28:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:15,535 INFO L225 Difference]: With dead ends: 311727 [2019-12-07 12:28:15,535 INFO L226 Difference]: Without dead ends: 311727 [2019-12-07 12:28:15,535 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-12-07 12:28:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311727 states. [2019-12-07 12:28:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311727 to 208531. [2019-12-07 12:28:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208531 states. [2019-12-07 12:28:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208531 states to 208531 states and 816182 transitions. [2019-12-07 12:28:21,821 INFO L78 Accepts]: Start accepts. Automaton has 208531 states and 816182 transitions. Word has length 22 [2019-12-07 12:28:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:21,822 INFO L462 AbstractCegarLoop]: Abstraction has 208531 states and 816182 transitions. [2019-12-07 12:28:21,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:28:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 208531 states and 816182 transitions. [2019-12-07 12:28:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:28:21,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:21,848 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] [2019-12-07 12:28:21,848 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -342281171, now seen corresponding path program 1 times [2019-12-07 12:28:21,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:21,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487644824] [2019-12-07 12:28:21,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:21,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487644824] [2019-12-07 12:28:21,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:21,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:28:21,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316552316] [2019-12-07 12:28:21,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:21,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:21,887 INFO L87 Difference]: Start difference. First operand 208531 states and 816182 transitions. Second operand 5 states. [2019-12-07 12:28:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:24,072 INFO L93 Difference]: Finished difference Result 296150 states and 1136936 transitions. [2019-12-07 12:28:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:28:24,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 12:28:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:24,799 INFO L225 Difference]: With dead ends: 296150 [2019-12-07 12:28:24,799 INFO L226 Difference]: Without dead ends: 296107 [2019-12-07 12:28:24,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:28:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296107 states. [2019-12-07 12:28:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296107 to 226776. [2019-12-07 12:28:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226776 states. [2019-12-07 12:28:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226776 states to 226776 states and 886132 transitions. [2019-12-07 12:28:33,674 INFO L78 Accepts]: Start accepts. Automaton has 226776 states and 886132 transitions. Word has length 25 [2019-12-07 12:28:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:33,674 INFO L462 AbstractCegarLoop]: Abstraction has 226776 states and 886132 transitions. [2019-12-07 12:28:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 226776 states and 886132 transitions. [2019-12-07 12:28:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:28:33,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:33,725 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] [2019-12-07 12:28:33,725 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1997113759, now seen corresponding path program 1 times [2019-12-07 12:28:33,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:33,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427761188] [2019-12-07 12:28:33,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:33,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427761188] [2019-12-07 12:28:33,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:33,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:28:33,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350662209] [2019-12-07 12:28:33,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:33,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:33,769 INFO L87 Difference]: Start difference. First operand 226776 states and 886132 transitions. Second operand 5 states. [2019-12-07 12:28:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:35,902 INFO L93 Difference]: Finished difference Result 310246 states and 1189915 transitions. [2019-12-07 12:28:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:28:35,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:28:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:36,717 INFO L225 Difference]: With dead ends: 310246 [2019-12-07 12:28:36,717 INFO L226 Difference]: Without dead ends: 310158 [2019-12-07 12:28:36,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:28:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310158 states. [2019-12-07 12:28:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310158 to 213311. [2019-12-07 12:28:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213311 states. [2019-12-07 12:28:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213311 states to 213311 states and 833508 transitions. [2019-12-07 12:28:43,606 INFO L78 Accepts]: Start accepts. Automaton has 213311 states and 833508 transitions. Word has length 28 [2019-12-07 12:28:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:43,607 INFO L462 AbstractCegarLoop]: Abstraction has 213311 states and 833508 transitions. [2019-12-07 12:28:43,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 213311 states and 833508 transitions. [2019-12-07 12:28:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:28:43,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:43,753 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] [2019-12-07 12:28:43,753 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1648973845, now seen corresponding path program 1 times [2019-12-07 12:28:43,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:43,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118388640] [2019-12-07 12:28:43,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:43,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118388640] [2019-12-07 12:28:43,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:43,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:28:43,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931780340] [2019-12-07 12:28:43,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:28:43,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:28:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:28:43,792 INFO L87 Difference]: Start difference. First operand 213311 states and 833508 transitions. Second operand 3 states. [2019-12-07 12:28:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:45,612 INFO L93 Difference]: Finished difference Result 335114 states and 1279591 transitions. [2019-12-07 12:28:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:28:45,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 12:28:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:46,109 INFO L225 Difference]: With dead ends: 335114 [2019-12-07 12:28:46,109 INFO L226 Difference]: Without dead ends: 201710 [2019-12-07 12:28:46,109 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-12-07 12:28:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201710 states. [2019-12-07 12:28:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201710 to 199660. [2019-12-07 12:28:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199660 states. [2019-12-07 12:28:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199660 states to 199660 states and 706218 transitions. [2019-12-07 12:28:53,575 INFO L78 Accepts]: Start accepts. Automaton has 199660 states and 706218 transitions. Word has length 36 [2019-12-07 12:28:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:53,575 INFO L462 AbstractCegarLoop]: Abstraction has 199660 states and 706218 transitions. [2019-12-07 12:28:53,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:28:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 199660 states and 706218 transitions. [2019-12-07 12:28:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:28:53,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:53,699 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] [2019-12-07 12:28:53,699 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash -435795538, now seen corresponding path program 1 times [2019-12-07 12:28:53,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:53,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281022880] [2019-12-07 12:28:53,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:53,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281022880] [2019-12-07 12:28:53,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:53,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:28:53,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763675637] [2019-12-07 12:28:53,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:28:53,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:28:53,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:28:53,742 INFO L87 Difference]: Start difference. First operand 199660 states and 706218 transitions. Second operand 4 states. [2019-12-07 12:28:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:54,022 INFO L93 Difference]: Finished difference Result 85150 states and 270380 transitions. [2019-12-07 12:28:54,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:28:54,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 12:28:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:54,162 INFO L225 Difference]: With dead ends: 85150 [2019-12-07 12:28:54,162 INFO L226 Difference]: Without dead ends: 85150 [2019-12-07 12:28:54,162 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-12-07 12:28:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85150 states. [2019-12-07 12:28:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85150 to 84982. [2019-12-07 12:28:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84982 states. [2019-12-07 12:28:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84982 states to 84982 states and 270000 transitions. [2019-12-07 12:28:56,001 INFO L78 Accepts]: Start accepts. Automaton has 84982 states and 270000 transitions. Word has length 37 [2019-12-07 12:28:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:56,002 INFO L462 AbstractCegarLoop]: Abstraction has 84982 states and 270000 transitions. [2019-12-07 12:28:56,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:28:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 84982 states and 270000 transitions. [2019-12-07 12:28:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:28:56,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:56,045 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] [2019-12-07 12:28:56,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2067327712, now seen corresponding path program 1 times [2019-12-07 12:28:56,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:56,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166425515] [2019-12-07 12:28:56,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:56,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166425515] [2019-12-07 12:28:56,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:56,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:28:56,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683344055] [2019-12-07 12:28:56,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:56,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:56,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:56,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:56,083 INFO L87 Difference]: Start difference. First operand 84982 states and 270000 transitions. Second operand 5 states. [2019-12-07 12:28:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:56,153 INFO L93 Difference]: Finished difference Result 19376 states and 52654 transitions. [2019-12-07 12:28:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:28:56,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 12:28:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:56,175 INFO L225 Difference]: With dead ends: 19376 [2019-12-07 12:28:56,175 INFO L226 Difference]: Without dead ends: 19337 [2019-12-07 12:28:56,175 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-12-07 12:28:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19337 states. [2019-12-07 12:28:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19337 to 18017. [2019-12-07 12:28:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18017 states. [2019-12-07 12:28:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18017 states to 18017 states and 49509 transitions. [2019-12-07 12:28:56,403 INFO L78 Accepts]: Start accepts. Automaton has 18017 states and 49509 transitions. Word has length 38 [2019-12-07 12:28:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:56,403 INFO L462 AbstractCegarLoop]: Abstraction has 18017 states and 49509 transitions. [2019-12-07 12:28:56,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 18017 states and 49509 transitions. [2019-12-07 12:28:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:28:56,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:56,419 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, 1, 1, 1, 1] [2019-12-07 12:28:56,419 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -616668294, now seen corresponding path program 1 times [2019-12-07 12:28:56,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:56,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021541706] [2019-12-07 12:28:56,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:56,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021541706] [2019-12-07 12:28:56,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:56,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:28:56,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136681121] [2019-12-07 12:28:56,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:28:56,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:28:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:28:56,466 INFO L87 Difference]: Start difference. First operand 18017 states and 49509 transitions. Second operand 6 states. [2019-12-07 12:28:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:56,524 INFO L93 Difference]: Finished difference Result 14931 states and 42543 transitions. [2019-12-07 12:28:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:28:56,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 12:28:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:56,533 INFO L225 Difference]: With dead ends: 14931 [2019-12-07 12:28:56,534 INFO L226 Difference]: Without dead ends: 8141 [2019-12-07 12:28:56,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:28:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2019-12-07 12:28:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 6989. [2019-12-07 12:28:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-12-07 12:28:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 20143 transitions. [2019-12-07 12:28:56,623 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 20143 transitions. Word has length 49 [2019-12-07 12:28:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:56,623 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 20143 transitions. [2019-12-07 12:28:56,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:28:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 20143 transitions. [2019-12-07 12:28:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:28:56,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:56,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:56,629 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:56,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1839454534, now seen corresponding path program 1 times [2019-12-07 12:28:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:56,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871999166] [2019-12-07 12:28:56,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:56,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871999166] [2019-12-07 12:28:56,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:56,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:28:56,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109797580] [2019-12-07 12:28:56,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:28:56,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:28:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:28:56,870 INFO L87 Difference]: Start difference. First operand 6989 states and 20143 transitions. Second operand 9 states. [2019-12-07 12:28:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:57,889 INFO L93 Difference]: Finished difference Result 17946 states and 46235 transitions. [2019-12-07 12:28:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:28:57,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-07 12:28:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:57,904 INFO L225 Difference]: With dead ends: 17946 [2019-12-07 12:28:57,904 INFO L226 Difference]: Without dead ends: 16449 [2019-12-07 12:28:57,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:28:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2019-12-07 12:28:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 9744. [2019-12-07 12:28:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9744 states. [2019-12-07 12:28:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9744 states to 9744 states and 27178 transitions. [2019-12-07 12:28:58,060 INFO L78 Accepts]: Start accepts. Automaton has 9744 states and 27178 transitions. Word has length 65 [2019-12-07 12:28:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:58,060 INFO L462 AbstractCegarLoop]: Abstraction has 9744 states and 27178 transitions. [2019-12-07 12:28:58,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:28:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9744 states and 27178 transitions. [2019-12-07 12:28:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:28:58,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:58,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:58,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 836099454, now seen corresponding path program 2 times [2019-12-07 12:28:58,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:58,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281518201] [2019-12-07 12:28:58,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:58,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281518201] [2019-12-07 12:28:58,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:58,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:28:58,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826856339] [2019-12-07 12:28:58,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:28:58,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:28:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:28:58,155 INFO L87 Difference]: Start difference. First operand 9744 states and 27178 transitions. Second operand 7 states. [2019-12-07 12:28:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:58,348 INFO L93 Difference]: Finished difference Result 24443 states and 66823 transitions. [2019-12-07 12:28:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:28:58,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 12:28:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:58,362 INFO L225 Difference]: With dead ends: 24443 [2019-12-07 12:28:58,363 INFO L226 Difference]: Without dead ends: 14415 [2019-12-07 12:28:58,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:28:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14415 states. [2019-12-07 12:28:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14415 to 10464. [2019-12-07 12:28:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10464 states. [2019-12-07 12:28:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10464 states to 10464 states and 28954 transitions. [2019-12-07 12:28:58,638 INFO L78 Accepts]: Start accepts. Automaton has 10464 states and 28954 transitions. Word has length 65 [2019-12-07 12:28:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:58,638 INFO L462 AbstractCegarLoop]: Abstraction has 10464 states and 28954 transitions. [2019-12-07 12:28:58,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:28:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 10464 states and 28954 transitions. [2019-12-07 12:28:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:28:58,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:58,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:58,647 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash -487428444, now seen corresponding path program 1 times [2019-12-07 12:28:58,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:58,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914627811] [2019-12-07 12:28:58,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:58,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914627811] [2019-12-07 12:28:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:28:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671718805] [2019-12-07 12:28:58,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:58,738 INFO L87 Difference]: Start difference. First operand 10464 states and 28954 transitions. Second operand 5 states. [2019-12-07 12:28:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:59,004 INFO L93 Difference]: Finished difference Result 14953 states and 41574 transitions. [2019-12-07 12:28:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:28:59,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:28:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:59,021 INFO L225 Difference]: With dead ends: 14953 [2019-12-07 12:28:59,021 INFO L226 Difference]: Without dead ends: 14953 [2019-12-07 12:28:59,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-07 12:28:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 11126. [2019-12-07 12:28:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11126 states. [2019-12-07 12:28:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11126 states to 11126 states and 30806 transitions. [2019-12-07 12:28:59,183 INFO L78 Accepts]: Start accepts. Automaton has 11126 states and 30806 transitions. Word has length 66 [2019-12-07 12:28:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:59,183 INFO L462 AbstractCegarLoop]: Abstraction has 11126 states and 30806 transitions. [2019-12-07 12:28:59,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11126 states and 30806 transitions. [2019-12-07 12:28:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:28:59,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:59,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:59,193 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1884051960, now seen corresponding path program 2 times [2019-12-07 12:28:59,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:59,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312248361] [2019-12-07 12:28:59,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:59,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312248361] [2019-12-07 12:28:59,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:59,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:28:59,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792924018] [2019-12-07 12:28:59,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:28:59,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:28:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:28:59,250 INFO L87 Difference]: Start difference. First operand 11126 states and 30806 transitions. Second operand 4 states. [2019-12-07 12:28:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:59,388 INFO L93 Difference]: Finished difference Result 9863 states and 26750 transitions. [2019-12-07 12:28:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:28:59,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 12:28:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:59,398 INFO L225 Difference]: With dead ends: 9863 [2019-12-07 12:28:59,398 INFO L226 Difference]: Without dead ends: 9863 [2019-12-07 12:28:59,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9863 states. [2019-12-07 12:28:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9863 to 9617. [2019-12-07 12:28:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9617 states. [2019-12-07 12:28:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9617 states to 9617 states and 26112 transitions. [2019-12-07 12:28:59,506 INFO L78 Accepts]: Start accepts. Automaton has 9617 states and 26112 transitions. Word has length 66 [2019-12-07 12:28:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:59,506 INFO L462 AbstractCegarLoop]: Abstraction has 9617 states and 26112 transitions. [2019-12-07 12:28:59,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:28:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9617 states and 26112 transitions. [2019-12-07 12:28:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:28:59,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:59,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:59,515 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1671280046, now seen corresponding path program 3 times [2019-12-07 12:28:59,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:59,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921151896] [2019-12-07 12:28:59,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:59,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921151896] [2019-12-07 12:28:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:28:59,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919632269] [2019-12-07 12:28:59,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:59,581 INFO L87 Difference]: Start difference. First operand 9617 states and 26112 transitions. Second operand 5 states. [2019-12-07 12:28:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:59,652 INFO L93 Difference]: Finished difference Result 13223 states and 34415 transitions. [2019-12-07 12:28:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:28:59,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:28:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:59,658 INFO L225 Difference]: With dead ends: 13223 [2019-12-07 12:28:59,658 INFO L226 Difference]: Without dead ends: 4957 [2019-12-07 12:28:59,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:28:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2019-12-07 12:28:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4501. [2019-12-07 12:28:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-12-07 12:28:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 11234 transitions. [2019-12-07 12:28:59,709 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 11234 transitions. Word has length 66 [2019-12-07 12:28:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:28:59,710 INFO L462 AbstractCegarLoop]: Abstraction has 4501 states and 11234 transitions. [2019-12-07 12:28:59,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:28:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 11234 transitions. [2019-12-07 12:28:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:28:59,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:28:59,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:28:59,713 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:28:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:28:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -864476260, now seen corresponding path program 4 times [2019-12-07 12:28:59,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:28:59,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718656253] [2019-12-07 12:28:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:28:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:28:59,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718656253] [2019-12-07 12:28:59,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:28:59,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:28:59,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162297656] [2019-12-07 12:28:59,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:28:59,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:28:59,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:28:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:28:59,763 INFO L87 Difference]: Start difference. First operand 4501 states and 11234 transitions. Second operand 5 states. [2019-12-07 12:28:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:28:59,941 INFO L93 Difference]: Finished difference Result 6145 states and 15396 transitions. [2019-12-07 12:28:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:28:59,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:28:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:28:59,946 INFO L225 Difference]: With dead ends: 6145 [2019-12-07 12:28:59,947 INFO L226 Difference]: Without dead ends: 6105 [2019-12-07 12:28:59,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:28:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2019-12-07 12:28:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5385. [2019-12-07 12:28:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2019-12-07 12:29:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 13584 transitions. [2019-12-07 12:29:00,006 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 13584 transitions. Word has length 66 [2019-12-07 12:29:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,006 INFO L462 AbstractCegarLoop]: Abstraction has 5385 states and 13584 transitions. [2019-12-07 12:29:00,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 13584 transitions. [2019-12-07 12:29:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:29:00,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,011 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash 858505902, now seen corresponding path program 1 times [2019-12-07 12:29:00,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:29:00,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317729455] [2019-12-07 12:29:00,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317729455] [2019-12-07 12:29:00,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:29:00,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347534085] [2019-12-07 12:29:00,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:00,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:29:00,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:00,066 INFO L87 Difference]: Start difference. First operand 5385 states and 13584 transitions. Second operand 4 states. [2019-12-07 12:29:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,095 INFO L93 Difference]: Finished difference Result 6048 states and 15110 transitions. [2019-12-07 12:29:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:00,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 12:29:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,096 INFO L225 Difference]: With dead ends: 6048 [2019-12-07 12:29:00,096 INFO L226 Difference]: Without dead ends: 737 [2019-12-07 12:29:00,096 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-12-07 12:29:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-07 12:29:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-12-07 12:29:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-07 12:29:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1611 transitions. [2019-12-07 12:29:00,102 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1611 transitions. Word has length 66 [2019-12-07 12:29:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,103 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1611 transitions. [2019-12-07 12:29:00,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1611 transitions. [2019-12-07 12:29:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:29:00,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,103 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 2 times [2019-12-07 12:29:00,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:29:00,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619682500] [2019-12-07 12:29:00,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:29:00,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619682500] [2019-12-07 12:29:00,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:00,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:29:00,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354000508] [2019-12-07 12:29:00,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:29:00,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:29:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:29:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:29:00,166 INFO L87 Difference]: Start difference. First operand 737 states and 1611 transitions. Second operand 8 states. [2019-12-07 12:29:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:00,293 INFO L93 Difference]: Finished difference Result 1253 states and 2697 transitions. [2019-12-07 12:29:00,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:29:00,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 12:29:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:00,294 INFO L225 Difference]: With dead ends: 1253 [2019-12-07 12:29:00,294 INFO L226 Difference]: Without dead ends: 874 [2019-12-07 12:29:00,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:29:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-07 12:29:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 824. [2019-12-07 12:29:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-12-07 12:29:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1743 transitions. [2019-12-07 12:29:00,301 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1743 transitions. Word has length 66 [2019-12-07 12:29:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:00,301 INFO L462 AbstractCegarLoop]: Abstraction has 824 states and 1743 transitions. [2019-12-07 12:29:00,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:29:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1743 transitions. [2019-12-07 12:29:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:29:00,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:00,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:00,302 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:29:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 3 times [2019-12-07 12:29:00,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:29:00,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281500055] [2019-12-07 12:29:00,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:29:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:29:00,375 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:29:00,375 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:29:00,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t565~0.base_37|) (= 0 v_~weak$$choice0~0_336) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37|) |v_ULTIMATE.start_main_~#t565~0.offset_25| 0)) |v_#memory_int_23|) (= v_~__unbuffered_cnt~0_142 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t565~0.base_37| 4) |v_#length_31|) (= v_~a~0_37 0) (= 0 |v_ULTIMATE.start_main_~#t565~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37|)) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_18|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_17|, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t565~0.offset=|v_ULTIMATE.start_main_~#t565~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t565~0.base=|v_ULTIMATE.start_main_~#t565~0.base_37|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_30|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t567~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t567~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t566~0.offset, ~x~0, ULTIMATE.start_main_~#t568~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t565~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t565~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:29:00,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t566~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12|) |v_ULTIMATE.start_main_~#t566~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t566~0.base_12| 4) |v_#length_21|) (not (= 0 |v_ULTIMATE.start_main_~#t566~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t566~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, #length, ULTIMATE.start_main_~#t566~0.offset] because there is no mapped edge [2019-12-07 12:29:00,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t567~0.base_12| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t567~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t567~0.base_12|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t567~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12|) |v_ULTIMATE.start_main_~#t567~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t567~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t567~0.base] because there is no mapped edge [2019-12-07 12:29:00,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_ULTIMATE.start_main_~#t568~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13|) |v_ULTIMATE.start_main_~#t568~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t568~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t568~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_11|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t568~0.offset, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:29:00,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:29:00,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| |P3Thread1of1ForFork2_#t~ite29_Out-182051432|)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-182051432 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-182051432 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| ~z$w_buff1~0_In-182051432) (or .cse1 .cse2)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| ~z$w_buff0~0_In-182051432) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-182051432, ~z$w_buff0~0=~z$w_buff0~0_In-182051432, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-182051432, ~z$w_buff1~0=~z$w_buff1~0_In-182051432} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-182051432|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-182051432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-182051432, ~z$w_buff0~0=~z$w_buff0~0_In-182051432, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-182051432, ~z$w_buff1~0=~z$w_buff1~0_In-182051432} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:29:00,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:29:00,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1770958768 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out1770958768| ~z$mem_tmp~0_In1770958768) (not .cse0)) (and (= ~z~0_In1770958768 |P3Thread1of1ForFork2_#t~ite48_Out1770958768|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1770958768, ~z$flush_delayed~0=~z$flush_delayed~0_In1770958768, ~z~0=~z~0_In1770958768} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1770958768, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1770958768|, ~z$flush_delayed~0=~z$flush_delayed~0_In1770958768, ~z~0=~z~0_In1770958768} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 12:29:00,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 12:29:00,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:29:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1944514880 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1944514880 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1944514880| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1944514880| ~z$w_buff0_used~0_In-1944514880)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944514880, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1944514880} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1944514880|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944514880, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1944514880} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 12:29:00,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-611700785 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-611700785| ~z~0_In-611700785)) (and (= ~z$mem_tmp~0_In-611700785 |P2Thread1of1ForFork1_#t~ite25_Out-611700785|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-611700785, ~z$flush_delayed~0=~z$flush_delayed~0_In-611700785, ~z~0=~z~0_In-611700785} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-611700785, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-611700785|, ~z$flush_delayed~0=~z$flush_delayed~0_In-611700785, ~z~0=~z~0_In-611700785} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:29:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:29:00,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1670301548 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1670301548 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1670301548 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1670301548 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1670301548| ~z$w_buff1_used~0_In-1670301548)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1670301548|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1670301548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670301548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1670301548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670301548} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1670301548|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1670301548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670301548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1670301548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670301548} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 12:29:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In13679332 ~z$r_buff0_thd4~0_Out13679332)) (.cse0 (= (mod ~z$w_buff0_used~0_In13679332 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In13679332 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out13679332) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In13679332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In13679332} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out13679332|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In13679332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out13679332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:29:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1258193933 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1258193933 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1258193933 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1258193933 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1258193933 |P3Thread1of1ForFork2_#t~ite54_Out-1258193933|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1258193933|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1258193933, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1258193933, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1258193933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1258193933} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1258193933|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1258193933, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1258193933, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1258193933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1258193933} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 12:29:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:29:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:29:00,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1219240277 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite60_Out1219240277| |ULTIMATE.start_main_#t~ite59_Out1219240277|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1219240277 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1219240277| ~z~0_In1219240277) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= ~z$w_buff1~0_In1219240277 |ULTIMATE.start_main_#t~ite59_Out1219240277|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1219240277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219240277, ~z$w_buff1~0=~z$w_buff1~0_In1219240277, ~z~0=~z~0_In1219240277} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1219240277|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1219240277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219240277, ~z$w_buff1~0=~z$w_buff1~0_In1219240277, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1219240277|, ~z~0=~z~0_In1219240277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:29:00,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-442271358 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-442271358 256) 0))) (or (and (= ~z$w_buff0_used~0_In-442271358 |ULTIMATE.start_main_#t~ite61_Out-442271358|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-442271358|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442271358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442271358} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442271358, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-442271358|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442271358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:29:00,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1455494131 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1455494131 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1455494131 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1455494131 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1455494131 |ULTIMATE.start_main_#t~ite62_Out1455494131|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1455494131|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1455494131, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455494131, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1455494131, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455494131} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1455494131|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1455494131, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455494131, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1455494131, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455494131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:29:00,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-822142493 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-822142493 256)))) (or (and (= ~z$r_buff0_thd0~0_In-822142493 |ULTIMATE.start_main_#t~ite63_Out-822142493|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-822142493|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-822142493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-822142493} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-822142493|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-822142493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-822142493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:29:00,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In717114726 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In717114726 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In717114726 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In717114726 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out717114726|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In717114726 |ULTIMATE.start_main_#t~ite64_Out717114726|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In717114726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In717114726, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717114726, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717114726} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In717114726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In717114726, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717114726, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717114726, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out717114726|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:29:00,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:29:00,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:29:00 BasicIcfg [2019-12-07 12:29:00,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:29:00,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:29:00,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:29:00,462 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:29:00,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:41" (3/4) ... [2019-12-07 12:29:00,463 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:29:00,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t565~0.base_37|) (= 0 v_~weak$$choice0~0_336) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37|) |v_ULTIMATE.start_main_~#t565~0.offset_25| 0)) |v_#memory_int_23|) (= v_~__unbuffered_cnt~0_142 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t565~0.base_37| 4) |v_#length_31|) (= v_~a~0_37 0) (= 0 |v_ULTIMATE.start_main_~#t565~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37|)) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_18|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_17|, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t565~0.offset=|v_ULTIMATE.start_main_~#t565~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t565~0.base=|v_ULTIMATE.start_main_~#t565~0.base_37|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_30|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t567~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t567~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t566~0.offset, ~x~0, ULTIMATE.start_main_~#t568~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t565~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t565~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:29:00,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t566~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12|) |v_ULTIMATE.start_main_~#t566~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t566~0.base_12| 4) |v_#length_21|) (not (= 0 |v_ULTIMATE.start_main_~#t566~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t566~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, #length, ULTIMATE.start_main_~#t566~0.offset] because there is no mapped edge [2019-12-07 12:29:00,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t567~0.base_12| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t567~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t567~0.base_12|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t567~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12|) |v_ULTIMATE.start_main_~#t567~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t567~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t567~0.base] because there is no mapped edge [2019-12-07 12:29:00,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_ULTIMATE.start_main_~#t568~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13|) |v_ULTIMATE.start_main_~#t568~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t568~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t568~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_11|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t568~0.offset, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:29:00,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:29:00,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| |P3Thread1of1ForFork2_#t~ite29_Out-182051432|)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-182051432 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-182051432 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| ~z$w_buff1~0_In-182051432) (or .cse1 .cse2)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-182051432| ~z$w_buff0~0_In-182051432) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-182051432, ~z$w_buff0~0=~z$w_buff0~0_In-182051432, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-182051432, ~z$w_buff1~0=~z$w_buff1~0_In-182051432} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-182051432|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-182051432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-182051432, ~z$w_buff0~0=~z$w_buff0~0_In-182051432, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-182051432, ~z$w_buff1~0=~z$w_buff1~0_In-182051432} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:29:00,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:29:00,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1770958768 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out1770958768| ~z$mem_tmp~0_In1770958768) (not .cse0)) (and (= ~z~0_In1770958768 |P3Thread1of1ForFork2_#t~ite48_Out1770958768|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1770958768, ~z$flush_delayed~0=~z$flush_delayed~0_In1770958768, ~z~0=~z~0_In1770958768} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1770958768, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1770958768|, ~z$flush_delayed~0=~z$flush_delayed~0_In1770958768, ~z~0=~z~0_In1770958768} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 12:29:00,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 12:29:00,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:29:00,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1944514880 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1944514880 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1944514880| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1944514880| ~z$w_buff0_used~0_In-1944514880)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944514880, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1944514880} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1944514880|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944514880, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1944514880} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 12:29:00,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-611700785 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-611700785| ~z~0_In-611700785)) (and (= ~z$mem_tmp~0_In-611700785 |P2Thread1of1ForFork1_#t~ite25_Out-611700785|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-611700785, ~z$flush_delayed~0=~z$flush_delayed~0_In-611700785, ~z~0=~z~0_In-611700785} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-611700785, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-611700785|, ~z$flush_delayed~0=~z$flush_delayed~0_In-611700785, ~z~0=~z~0_In-611700785} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:29:00,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:29:00,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-1670301548 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1670301548 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1670301548 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1670301548 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1670301548| ~z$w_buff1_used~0_In-1670301548)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1670301548|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1670301548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670301548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1670301548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670301548} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1670301548|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1670301548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670301548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1670301548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1670301548} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 12:29:00,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_In13679332 ~z$r_buff0_thd4~0_Out13679332)) (.cse0 (= (mod ~z$w_buff0_used~0_In13679332 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In13679332 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out13679332) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In13679332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In13679332} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out13679332|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In13679332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out13679332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:29:00,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1258193933 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1258193933 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1258193933 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1258193933 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1258193933 |P3Thread1of1ForFork2_#t~ite54_Out-1258193933|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1258193933|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1258193933, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1258193933, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1258193933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1258193933} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1258193933|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1258193933, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1258193933, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1258193933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1258193933} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 12:29:00,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:29:00,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:29:00,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1219240277 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite60_Out1219240277| |ULTIMATE.start_main_#t~ite59_Out1219240277|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1219240277 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1219240277| ~z~0_In1219240277) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= ~z$w_buff1~0_In1219240277 |ULTIMATE.start_main_#t~ite59_Out1219240277|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1219240277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219240277, ~z$w_buff1~0=~z$w_buff1~0_In1219240277, ~z~0=~z~0_In1219240277} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1219240277|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1219240277, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219240277, ~z$w_buff1~0=~z$w_buff1~0_In1219240277, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1219240277|, ~z~0=~z~0_In1219240277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:29:00,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-442271358 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-442271358 256) 0))) (or (and (= ~z$w_buff0_used~0_In-442271358 |ULTIMATE.start_main_#t~ite61_Out-442271358|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-442271358|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442271358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442271358} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442271358, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-442271358|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442271358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:29:00,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1455494131 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1455494131 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1455494131 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1455494131 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1455494131 |ULTIMATE.start_main_#t~ite62_Out1455494131|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1455494131|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1455494131, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455494131, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1455494131, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455494131} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1455494131|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1455494131, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455494131, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1455494131, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455494131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:29:00,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-822142493 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-822142493 256)))) (or (and (= ~z$r_buff0_thd0~0_In-822142493 |ULTIMATE.start_main_#t~ite63_Out-822142493|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-822142493|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-822142493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-822142493} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-822142493|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-822142493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-822142493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:29:00,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In717114726 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In717114726 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In717114726 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In717114726 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out717114726|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In717114726 |ULTIMATE.start_main_#t~ite64_Out717114726|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In717114726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In717114726, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717114726, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717114726} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In717114726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In717114726, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In717114726, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717114726, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out717114726|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:29:00,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:29:00,542 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9346971f-107d-4071-8bb2-a9c920bad8d4/bin/uautomizer/witness.graphml [2019-12-07 12:29:00,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:29:00,543 INFO L168 Benchmark]: Toolchain (without parser) took 139588.16 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 935.2 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,543 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:29:00,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,544 INFO L168 Benchmark]: Boogie Preprocessor took 28.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,544 INFO L168 Benchmark]: RCFGBuilder took 466.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,544 INFO L168 Benchmark]: TraceAbstraction took 138567.93 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 999.4 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,545 INFO L168 Benchmark]: Witness Printer took 80.54 ms. Allocated memory is still 8.9 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:00,546 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 466.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 138567.93 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 999.4 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 80.54 ms. Allocated memory is still 8.9 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t567, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t568, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L812] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 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 5 procedures, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 138.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5051 SDtfs, 5607 SDslu, 9079 SDs, 0 SdLazy, 3390 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319479occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 417548 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 249021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...