./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.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_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/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 aa6f701e3114f964d079a3c4b968eefa99b542c6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 14:28:31,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:28:31,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:28:31,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:28:31,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:28:31,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:28:31,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:28:31,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:28:31,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:28:31,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:28:31,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:28:31,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:28:31,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:28:31,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:28:31,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:28:31,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:28:31,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:28:31,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:28:31,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:28:31,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:28:31,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:28:31,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:28:31,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:28:31,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:28:31,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:28:31,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:28:31,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:28:31,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:28:31,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:28:31,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:28:31,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:28:31,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:28:31,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:28:31,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:28:31,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:28:31,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:28:31,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:28:31,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:28:31,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:28:31,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:28:31,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:28:31,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:28:31,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:28:31,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:28:31,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:28:31,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:28:31,455 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:28:31,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:28:31,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:28:31,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:28:31,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:28:31,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:28:31,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:28:31,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:28:31,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:28:31,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:28:31,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:28:31,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:28:31,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:28:31,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:28:31,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:28:31,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:28:31,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:28:31,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:28:31,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:28:31,459 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:28:31,460 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_46bafd78-8212-4c3c-84c0-4290b1e89b76/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 -> aa6f701e3114f964d079a3c4b968eefa99b542c6 [2019-12-07 14:28:31,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:28:31,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:28:31,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:28:31,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:28:31,572 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:28:31,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-12-07 14:28:31,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/data/f8bd949b1/2f9f73f0649b4e1cbbd012e2c15f5f98/FLAG4ac1b2662 [2019-12-07 14:28:31,977 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:28:31,977 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-12-07 14:28:31,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/data/f8bd949b1/2f9f73f0649b4e1cbbd012e2c15f5f98/FLAG4ac1b2662 [2019-12-07 14:28:31,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/data/f8bd949b1/2f9f73f0649b4e1cbbd012e2c15f5f98 [2019-12-07 14:28:32,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:28:32,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:28:32,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:28:32,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:28:32,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:28:32,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:28:31" (1/1) ... [2019-12-07 14:28:32,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32, skipping insertion in model container [2019-12-07 14:28:32,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:28:31" (1/1) ... [2019-12-07 14:28:32,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:28:32,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:28:32,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:28:32,324 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:28:32,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:28:32,407 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:28:32,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32 WrapperNode [2019-12-07 14:28:32,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:28:32,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:28:32,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:28:32,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:28:32,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:28:32,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:28:32,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:28:32,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:28:32,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... [2019-12-07 14:28:32,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:28:32,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:28:32,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:28:32,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:28:32,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/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 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:28:32,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:28:32,516 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:28:32,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:28:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:28:32,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:28:32,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:28:32,518 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 14:28:32,844 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:28:32,845 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:28:32,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:28:32 BoogieIcfgContainer [2019-12-07 14:28:32,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:28:32,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:28:32,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:28:32,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:28:32,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:28:31" (1/3) ... [2019-12-07 14:28:32,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213fd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:28:32, skipping insertion in model container [2019-12-07 14:28:32,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:28:32" (2/3) ... [2019-12-07 14:28:32,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213fd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:28:32, skipping insertion in model container [2019-12-07 14:28:32,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:28:32" (3/3) ... [2019-12-07 14:28:32,850 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt.i [2019-12-07 14:28:32,856 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:28:32,856 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:28:32,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:28:32,861 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:28:32,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:28:32,929 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:28:32,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:28:32,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:28:32,930 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:28:32,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:28:32,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:28:32,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:28:32,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:28:32,940 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-07 14:28:32,941 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 14:28:32,985 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 14:28:32,985 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:28:32,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:28:33,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 14:28:33,022 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 14:28:33,022 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:28:33,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:28:33,033 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 14:28:33,034 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:28:35,520 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 14:28:35,656 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-07 14:28:35,656 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 14:28:35,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-07 14:28:35,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-07 14:28:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-07 14:28:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:28:35,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:35,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:28:35,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-07 14:28:35,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:35,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500199507] [2019-12-07 14:28:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:36,085 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 14:28:36,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500199507] [2019-12-07 14:28:36,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:36,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:28:36,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753299404] [2019-12-07 14:28:36,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:36,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:36,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:36,108 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-07 14:28:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:36,289 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-07 14:28:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:36,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:28:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:36,352 INFO L225 Difference]: With dead ends: 6240 [2019-12-07 14:28:36,353 INFO L226 Difference]: Without dead ends: 5850 [2019-12-07 14:28:36,353 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 14:28:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-07 14:28:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-07 14:28:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-07 14:28:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-07 14:28:36,583 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-07 14:28:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:36,584 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-07 14:28:36,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-07 14:28:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:28:36,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:36,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:36,586 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-07 14:28:36,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:36,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35293009] [2019-12-07 14:28:36,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:36,644 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 14:28:36,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35293009] [2019-12-07 14:28:36,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:36,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:36,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193723154] [2019-12-07 14:28:36,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:36,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:36,646 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-12-07 14:28:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:36,874 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-12-07 14:28:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:28:36,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:28:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:36,936 INFO L225 Difference]: With dead ends: 9088 [2019-12-07 14:28:36,936 INFO L226 Difference]: Without dead ends: 9073 [2019-12-07 14:28:36,937 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 14:28:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-12-07 14:28:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-12-07 14:28:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-12-07 14:28:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-12-07 14:28:37,138 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-12-07 14:28:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:37,138 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-12-07 14:28:37,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-12-07 14:28:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:28:37,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:37,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:37,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-07 14:28:37,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:37,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650481968] [2019-12-07 14:28:37,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:37,192 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 14:28:37,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650481968] [2019-12-07 14:28:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:37,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840355355] [2019-12-07 14:28:37,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:37,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:37,194 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-12-07 14:28:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:37,310 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-12-07 14:28:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:37,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:28:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:37,337 INFO L225 Difference]: With dead ends: 10304 [2019-12-07 14:28:37,337 INFO L226 Difference]: Without dead ends: 10304 [2019-12-07 14:28:37,337 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 14:28:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-12-07 14:28:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-12-07 14:28:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-12-07 14:28:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-12-07 14:28:37,553 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-12-07 14:28:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:37,553 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-12-07 14:28:37,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-12-07 14:28:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:28:37,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:37,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:37,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-07 14:28:37,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:37,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881222238] [2019-12-07 14:28:37,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:37,606 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 14:28:37,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881222238] [2019-12-07 14:28:37,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:37,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:37,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208582417] [2019-12-07 14:28:37,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:37,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:37,608 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-12-07 14:28:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:37,719 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-12-07 14:28:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:28:37,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:28:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:37,737 INFO L225 Difference]: With dead ends: 10707 [2019-12-07 14:28:37,737 INFO L226 Difference]: Without dead ends: 10697 [2019-12-07 14:28:37,737 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 14:28:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-12-07 14:28:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-12-07 14:28:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-07 14:28:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-12-07 14:28:37,918 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-12-07 14:28:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:37,918 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-12-07 14:28:37,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-12-07 14:28:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:28:37,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:37,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:37,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-07 14:28:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729513649] [2019-12-07 14:28:37,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:37,955 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 14:28:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729513649] [2019-12-07 14:28:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:37,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:37,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285414018] [2019-12-07 14:28:37,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:37,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:37,956 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-12-07 14:28:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:38,081 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-12-07 14:28:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:28:38,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:28:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:38,103 INFO L225 Difference]: With dead ends: 11850 [2019-12-07 14:28:38,104 INFO L226 Difference]: Without dead ends: 11835 [2019-12-07 14:28:38,104 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 14:28:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-12-07 14:28:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-12-07 14:28:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-12-07 14:28:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-12-07 14:28:38,297 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-12-07 14:28:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:38,297 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-12-07 14:28:38,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-12-07 14:28:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:28:38,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:38,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:38,300 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-12-07 14:28:38,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:38,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276460655] [2019-12-07 14:28:38,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:38,324 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 14:28:38,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276460655] [2019-12-07 14:28:38,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:38,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:38,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475728379] [2019-12-07 14:28:38,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:38,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:38,325 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-12-07 14:28:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:38,334 INFO L93 Difference]: Finished difference Result 1607 states and 3887 transitions. [2019-12-07 14:28:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:38,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:28:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:38,336 INFO L225 Difference]: With dead ends: 1607 [2019-12-07 14:28:38,336 INFO L226 Difference]: Without dead ends: 1607 [2019-12-07 14:28:38,337 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 14:28:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-07 14:28:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2019-12-07 14:28:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-07 14:28:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-07 14:28:38,352 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 16 [2019-12-07 14:28:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:38,352 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-07 14:28:38,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-07 14:28:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:28:38,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:38,354 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] [2019-12-07 14:28:38,354 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-07 14:28:38,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:38,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104270148] [2019-12-07 14:28:38,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:38,397 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 14:28:38,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104270148] [2019-12-07 14:28:38,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:38,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:38,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032494742] [2019-12-07 14:28:38,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:38,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:38,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:38,398 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-07 14:28:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:38,514 INFO L93 Difference]: Finished difference Result 2202 states and 5235 transitions. [2019-12-07 14:28:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:28:38,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:28:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:38,516 INFO L225 Difference]: With dead ends: 2202 [2019-12-07 14:28:38,516 INFO L226 Difference]: Without dead ends: 2200 [2019-12-07 14:28:38,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:28:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-12-07 14:28:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1723. [2019-12-07 14:28:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-07 14:28:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 4159 transitions. [2019-12-07 14:28:38,541 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 4159 transitions. Word has length 26 [2019-12-07 14:28:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:38,541 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 4159 transitions. [2019-12-07 14:28:38,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 4159 transitions. [2019-12-07 14:28:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:28:38,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:38,544 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] [2019-12-07 14:28:38,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:38,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash -344365836, now seen corresponding path program 1 times [2019-12-07 14:28:38,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:38,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895224683] [2019-12-07 14:28:38,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:38,573 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 14:28:38,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895224683] [2019-12-07 14:28:38,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:38,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:38,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445027189] [2019-12-07 14:28:38,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:38,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:38,575 INFO L87 Difference]: Start difference. First operand 1723 states and 4159 transitions. Second operand 3 states. [2019-12-07 14:28:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:38,605 INFO L93 Difference]: Finished difference Result 2209 states and 5197 transitions. [2019-12-07 14:28:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:38,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 14:28:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:38,607 INFO L225 Difference]: With dead ends: 2209 [2019-12-07 14:28:38,607 INFO L226 Difference]: Without dead ends: 2209 [2019-12-07 14:28:38,607 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 14:28:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2019-12-07 14:28:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1753. [2019-12-07 14:28:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-12-07 14:28:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 4059 transitions. [2019-12-07 14:28:38,626 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 4059 transitions. Word has length 26 [2019-12-07 14:28:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:38,626 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 4059 transitions. [2019-12-07 14:28:38,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 4059 transitions. [2019-12-07 14:28:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:28:38,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:38,628 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] [2019-12-07 14:28:38,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -281839928, now seen corresponding path program 1 times [2019-12-07 14:28:38,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:38,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860253791] [2019-12-07 14:28:38,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:38,685 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 14:28:38,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860253791] [2019-12-07 14:28:38,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:38,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:28:38,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138300051] [2019-12-07 14:28:38,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:38,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:38,686 INFO L87 Difference]: Start difference. First operand 1753 states and 4059 transitions. Second operand 5 states. [2019-12-07 14:28:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:38,918 INFO L93 Difference]: Finished difference Result 2526 states and 5750 transitions. [2019-12-07 14:28:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:28:38,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:28:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:38,920 INFO L225 Difference]: With dead ends: 2526 [2019-12-07 14:28:38,920 INFO L226 Difference]: Without dead ends: 2526 [2019-12-07 14:28:38,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:28:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2019-12-07 14:28:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2091. [2019-12-07 14:28:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-12-07 14:28:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4785 transitions. [2019-12-07 14:28:38,941 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4785 transitions. Word has length 26 [2019-12-07 14:28:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:38,942 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 4785 transitions. [2019-12-07 14:28:38,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4785 transitions. [2019-12-07 14:28:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:28:38,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:38,944 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] [2019-12-07 14:28:38,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1359644488, now seen corresponding path program 1 times [2019-12-07 14:28:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:38,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837537561] [2019-12-07 14:28:38,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:38,984 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 14:28:38,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837537561] [2019-12-07 14:28:38,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:38,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:38,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366978486] [2019-12-07 14:28:38,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:38,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:38,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:38,985 INFO L87 Difference]: Start difference. First operand 2091 states and 4785 transitions. Second operand 5 states. [2019-12-07 14:28:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,101 INFO L93 Difference]: Finished difference Result 2585 states and 5903 transitions. [2019-12-07 14:28:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:28:39,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:28:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,103 INFO L225 Difference]: With dead ends: 2585 [2019-12-07 14:28:39,103 INFO L226 Difference]: Without dead ends: 2583 [2019-12-07 14:28:39,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 14:28:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-07 14:28:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2064. [2019-12-07 14:28:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2019-12-07 14:28:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 4700 transitions. [2019-12-07 14:28:39,122 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 4700 transitions. Word has length 27 [2019-12-07 14:28:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,123 INFO L462 AbstractCegarLoop]: Abstraction has 2064 states and 4700 transitions. [2019-12-07 14:28:39,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 4700 transitions. [2019-12-07 14:28:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:28:39,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,125 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] [2019-12-07 14:28:39,125 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 620709763, now seen corresponding path program 1 times [2019-12-07 14:28:39,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383349366] [2019-12-07 14:28:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,158 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 14:28:39,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383349366] [2019-12-07 14:28:39,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:28:39,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734144813] [2019-12-07 14:28:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:28:39,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:28:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:28:39,159 INFO L87 Difference]: Start difference. First operand 2064 states and 4700 transitions. Second operand 4 states. [2019-12-07 14:28:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,172 INFO L93 Difference]: Finished difference Result 1075 states and 2243 transitions. [2019-12-07 14:28:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:28:39,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:28:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,173 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 14:28:39,173 INFO L226 Difference]: Without dead ends: 1075 [2019-12-07 14:28:39,173 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 14:28:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-07 14:28:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 943. [2019-12-07 14:28:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-12-07 14:28:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1991 transitions. [2019-12-07 14:28:39,182 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1991 transitions. Word has length 27 [2019-12-07 14:28:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,182 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1991 transitions. [2019-12-07 14:28:39,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:28:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1991 transitions. [2019-12-07 14:28:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:28:39,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,184 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] [2019-12-07 14:28:39,184 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,184 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 1 times [2019-12-07 14:28:39,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945001498] [2019-12-07 14:28:39,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,240 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 14:28:39,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945001498] [2019-12-07 14:28:39,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:28:39,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977223692] [2019-12-07 14:28:39,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:28:39,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:28:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:28:39,242 INFO L87 Difference]: Start difference. First operand 943 states and 1991 transitions. Second operand 5 states. [2019-12-07 14:28:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,349 INFO L93 Difference]: Finished difference Result 1146 states and 2377 transitions. [2019-12-07 14:28:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:28:39,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 14:28:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,350 INFO L225 Difference]: With dead ends: 1146 [2019-12-07 14:28:39,350 INFO L226 Difference]: Without dead ends: 1146 [2019-12-07 14:28:39,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 14:28:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2019-12-07 14:28:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 969. [2019-12-07 14:28:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-07 14:28:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2043 transitions. [2019-12-07 14:28:39,360 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2043 transitions. Word has length 41 [2019-12-07 14:28:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,360 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2043 transitions. [2019-12-07 14:28:39,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:28:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2043 transitions. [2019-12-07 14:28:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:28:39,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,361 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] [2019-12-07 14:28:39,361 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2091375240, now seen corresponding path program 2 times [2019-12-07 14:28:39,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86994344] [2019-12-07 14:28:39,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,395 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 14:28:39,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86994344] [2019-12-07 14:28:39,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:39,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23393978] [2019-12-07 14:28:39,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:39,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:39,396 INFO L87 Difference]: Start difference. First operand 969 states and 2043 transitions. Second operand 3 states. [2019-12-07 14:28:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,405 INFO L93 Difference]: Finished difference Result 969 states and 2041 transitions. [2019-12-07 14:28:39,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:39,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 14:28:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,406 INFO L225 Difference]: With dead ends: 969 [2019-12-07 14:28:39,406 INFO L226 Difference]: Without dead ends: 969 [2019-12-07 14:28:39,407 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 14:28:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-12-07 14:28:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 823. [2019-12-07 14:28:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 14:28:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1760 transitions. [2019-12-07 14:28:39,417 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1760 transitions. Word has length 41 [2019-12-07 14:28:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,418 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1760 transitions. [2019-12-07 14:28:39,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1760 transitions. [2019-12-07 14:28:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:28:39,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,420 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] [2019-12-07 14:28:39,420 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1761581763, now seen corresponding path program 1 times [2019-12-07 14:28:39,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975936613] [2019-12-07 14:28:39,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,467 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 14:28:39,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975936613] [2019-12-07 14:28:39,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:39,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211254747] [2019-12-07 14:28:39,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:39,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:39,469 INFO L87 Difference]: Start difference. First operand 823 states and 1760 transitions. Second operand 3 states. [2019-12-07 14:28:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,481 INFO L93 Difference]: Finished difference Result 1432 states and 3083 transitions. [2019-12-07 14:28:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:39,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 14:28:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,482 INFO L225 Difference]: With dead ends: 1432 [2019-12-07 14:28:39,482 INFO L226 Difference]: Without dead ends: 1338 [2019-12-07 14:28:39,483 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 14:28:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-12-07 14:28:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 803. [2019-12-07 14:28:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 14:28:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1709 transitions. [2019-12-07 14:28:39,492 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1709 transitions. Word has length 42 [2019-12-07 14:28:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,492 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1709 transitions. [2019-12-07 14:28:39,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1709 transitions. [2019-12-07 14:28:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:28:39,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,493 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] [2019-12-07 14:28:39,493 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 2 times [2019-12-07 14:28:39,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338929169] [2019-12-07 14:28:39,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,525 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 14:28:39,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338929169] [2019-12-07 14:28:39,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:28:39,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928043905] [2019-12-07 14:28:39,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:28:39,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:28:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:28:39,526 INFO L87 Difference]: Start difference. First operand 803 states and 1709 transitions. Second operand 3 states. [2019-12-07 14:28:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,533 INFO L93 Difference]: Finished difference Result 1408 states and 3024 transitions. [2019-12-07 14:28:39,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:28:39,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 14:28:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,534 INFO L225 Difference]: With dead ends: 1408 [2019-12-07 14:28:39,534 INFO L226 Difference]: Without dead ends: 633 [2019-12-07 14:28:39,534 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 14:28:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-12-07 14:28:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-12-07 14:28:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-12-07 14:28:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1363 transitions. [2019-12-07 14:28:39,540 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1363 transitions. Word has length 42 [2019-12-07 14:28:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,540 INFO L462 AbstractCegarLoop]: Abstraction has 633 states and 1363 transitions. [2019-12-07 14:28:39,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:28:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1363 transitions. [2019-12-07 14:28:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:28:39,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,541 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] [2019-12-07 14:28:39,541 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 3 times [2019-12-07 14:28:39,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493753087] [2019-12-07 14:28:39,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:39,583 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 14:28:39,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493753087] [2019-12-07 14:28:39,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:28:39,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:28:39,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352417721] [2019-12-07 14:28:39,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:28:39,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:39,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:28:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:28:39,585 INFO L87 Difference]: Start difference. First operand 633 states and 1363 transitions. Second operand 6 states. [2019-12-07 14:28:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:39,666 INFO L93 Difference]: Finished difference Result 1026 states and 2144 transitions. [2019-12-07 14:28:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:28:39,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 14:28:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:39,667 INFO L225 Difference]: With dead ends: 1026 [2019-12-07 14:28:39,667 INFO L226 Difference]: Without dead ends: 699 [2019-12-07 14:28:39,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:28:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-12-07 14:28:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 657. [2019-12-07 14:28:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-12-07 14:28:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1390 transitions. [2019-12-07 14:28:39,674 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1390 transitions. Word has length 42 [2019-12-07 14:28:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:39,674 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1390 transitions. [2019-12-07 14:28:39,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:28:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1390 transitions. [2019-12-07 14:28:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:28:39,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:39,675 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] [2019-12-07 14:28:39,675 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:39,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 4 times [2019-12-07 14:28:39,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:39,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577920737] [2019-12-07 14:28:39,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:28:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:28:39,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:28:39,738 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:28:39,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2571~0.base_24| 4) |v_#length_15|) (= 0 v_~x$r_buff0_thd2~0_163) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) (= v_~x$r_buff0_thd0~0_130 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24|) 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24| 1)) (= v_~y~0_90 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff1_thd2~0_124) (= |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_~#t2571~0.base=|v_ULTIMATE.start_main_~#t2571~0.base_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2571~0.offset=|v_ULTIMATE.start_main_~#t2571~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2571~0.base, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2571~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2572~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:28:39,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2572~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t2572~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11|) |v_ULTIMATE.start_main_~#t2572~0.offset_9| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2572~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2572~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2572~0.base] because there is no mapped edge [2019-12-07 14:28:39,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:28:39,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1927646219 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1927646219 |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1927646219 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1927646219 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1927646219 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1927646219 256) 0)))) (= |P0Thread1of1ForFork1_#t~ite9_Out-1927646219| |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-1927646219| ~x$w_buff0~0_In-1927646219) (= |P0Thread1of1ForFork1_#t~ite8_In-1927646219| |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1927646219, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1927646219, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1927646219|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1927646219, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1927646219, ~weak$$choice2~0=~weak$$choice2~0_In-1927646219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927646219} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1927646219, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1927646219, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1927646219|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1927646219|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1927646219, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1927646219, ~weak$$choice2~0=~weak$$choice2~0_In-1927646219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927646219} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 14:28:39,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 14:28:39,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:28:39,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In276275168 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In276275168 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out276275168| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out276275168| ~x$w_buff0_used~0_In276275168)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In276275168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In276275168} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In276275168, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out276275168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In276275168} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:28:39,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In687996141 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In687996141 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In687996141 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In687996141 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In687996141 |P1Thread1of1ForFork0_#t~ite29_Out687996141|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out687996141|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In687996141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In687996141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In687996141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In687996141} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In687996141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In687996141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In687996141, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out687996141|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In687996141} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:28:39,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-376569540 ~x$r_buff0_thd2~0_In-376569540)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-376569540 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-376569540 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out-376569540 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-376569540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376569540} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-376569540|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-376569540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376569540} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:28:39,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In638855877 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In638855877 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In638855877 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In638855877 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out638855877| ~x$r_buff1_thd2~0_In638855877) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out638855877| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In638855877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In638855877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In638855877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638855877} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out638855877|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In638855877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In638855877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In638855877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638855877} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:28:39,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:28:39,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:28:39,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1965284689 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1965284689 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out-1965284689| |ULTIMATE.start_main_#t~ite34_Out-1965284689|))) (or (and (= ~x~0_In-1965284689 |ULTIMATE.start_main_#t~ite34_Out-1965284689|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1965284689| ~x$w_buff1~0_In-1965284689) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1965284689, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1965284689, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1965284689, ~x~0=~x~0_In-1965284689} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1965284689, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1965284689|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1965284689, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1965284689, ~x~0=~x~0_In-1965284689, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1965284689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:28:39,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1673892800 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1673892800 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1673892800| ~x$w_buff0_used~0_In-1673892800)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1673892800| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673892800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673892800} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673892800, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1673892800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673892800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:28:39,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1145959482 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1145959482 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1145959482 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1145959482 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1145959482 |ULTIMATE.start_main_#t~ite37_Out1145959482|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1145959482|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1145959482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1145959482, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1145959482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145959482} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1145959482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1145959482, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1145959482|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1145959482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145959482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:28:39,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1542162070 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1542162070 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out1542162070|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1542162070 |ULTIMATE.start_main_#t~ite38_Out1542162070|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1542162070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1542162070} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1542162070, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1542162070|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1542162070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:28:39,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In665619864 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In665619864 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In665619864 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In665619864 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out665619864| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out665619864| ~x$r_buff1_thd0~0_In665619864)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665619864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665619864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665619864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665619864} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665619864, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out665619864|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665619864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665619864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665619864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:28:39,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:28:39,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:28:39 BasicIcfg [2019-12-07 14:28:39,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:28:39,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:28:39,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:28:39,797 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:28:39,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:28:32" (3/4) ... [2019-12-07 14:28:39,799 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:28:39,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2571~0.base_24| 4) |v_#length_15|) (= 0 v_~x$r_buff0_thd2~0_163) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) (= v_~x$r_buff0_thd0~0_130 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24|) 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24| 1)) (= v_~y~0_90 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff1_thd2~0_124) (= |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_~#t2571~0.base=|v_ULTIMATE.start_main_~#t2571~0.base_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2571~0.offset=|v_ULTIMATE.start_main_~#t2571~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2571~0.base, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2571~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2572~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:28:39,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2572~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t2572~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11|) |v_ULTIMATE.start_main_~#t2572~0.offset_9| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2572~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2572~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2572~0.base] because there is no mapped edge [2019-12-07 14:28:39,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:28:39,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1927646219 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1927646219 |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1927646219 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1927646219 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1927646219 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1927646219 256) 0)))) (= |P0Thread1of1ForFork1_#t~ite9_Out-1927646219| |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-1927646219| ~x$w_buff0~0_In-1927646219) (= |P0Thread1of1ForFork1_#t~ite8_In-1927646219| |P0Thread1of1ForFork1_#t~ite8_Out-1927646219|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1927646219, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1927646219, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1927646219|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1927646219, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1927646219, ~weak$$choice2~0=~weak$$choice2~0_In-1927646219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927646219} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1927646219, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1927646219, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1927646219|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1927646219|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1927646219, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1927646219, ~weak$$choice2~0=~weak$$choice2~0_In-1927646219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927646219} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 14:28:39,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 14:28:39,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:28:39,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In276275168 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In276275168 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out276275168| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out276275168| ~x$w_buff0_used~0_In276275168)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In276275168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In276275168} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In276275168, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out276275168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In276275168} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:28:39,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In687996141 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In687996141 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In687996141 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In687996141 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In687996141 |P1Thread1of1ForFork0_#t~ite29_Out687996141|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out687996141|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In687996141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In687996141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In687996141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In687996141} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In687996141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In687996141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In687996141, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out687996141|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In687996141} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-376569540 ~x$r_buff0_thd2~0_In-376569540)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-376569540 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-376569540 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out-376569540 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-376569540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376569540} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-376569540|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-376569540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376569540} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In638855877 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In638855877 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In638855877 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In638855877 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out638855877| ~x$r_buff1_thd2~0_In638855877) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out638855877| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In638855877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In638855877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In638855877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638855877} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out638855877|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In638855877, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In638855877, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In638855877, ~x$w_buff0_used~0=~x$w_buff0_used~0_In638855877} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1965284689 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1965284689 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out-1965284689| |ULTIMATE.start_main_#t~ite34_Out-1965284689|))) (or (and (= ~x~0_In-1965284689 |ULTIMATE.start_main_#t~ite34_Out-1965284689|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1965284689| ~x$w_buff1~0_In-1965284689) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1965284689, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1965284689, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1965284689, ~x~0=~x~0_In-1965284689} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1965284689, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1965284689|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1965284689, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1965284689, ~x~0=~x~0_In-1965284689, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1965284689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:28:39,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1673892800 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1673892800 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1673892800| ~x$w_buff0_used~0_In-1673892800)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1673892800| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673892800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673892800} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673892800, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1673892800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673892800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:28:39,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1145959482 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1145959482 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1145959482 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1145959482 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1145959482 |ULTIMATE.start_main_#t~ite37_Out1145959482|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1145959482|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1145959482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1145959482, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1145959482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145959482} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1145959482, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1145959482, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1145959482|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1145959482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145959482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:28:39,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1542162070 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1542162070 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out1542162070|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1542162070 |ULTIMATE.start_main_#t~ite38_Out1542162070|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1542162070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1542162070} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1542162070, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1542162070|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1542162070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:28:39,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In665619864 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In665619864 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In665619864 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In665619864 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out665619864| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out665619864| ~x$r_buff1_thd0~0_In665619864)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665619864, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665619864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665619864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665619864} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665619864, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out665619864|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665619864, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665619864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665619864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:28:39,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:28:39,866 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46bafd78-8212-4c3c-84c0-4290b1e89b76/bin/uautomizer/witness.graphml [2019-12-07 14:28:39,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:28:39,868 INFO L168 Benchmark]: Toolchain (without parser) took 7867.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 181.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,868 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:28:39,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,870 INFO L168 Benchmark]: Boogie Preprocessor took 24.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:28:39,870 INFO L168 Benchmark]: RCFGBuilder took 375.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,870 INFO L168 Benchmark]: TraceAbstraction took 6950.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -146.1 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,871 INFO L168 Benchmark]: Witness Printer took 69.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:28:39,873 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 375.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6950.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -146.1 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2571, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2572, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1714 SDtfs, 1153 SDslu, 2312 SDs, 0 SdLazy, 1207 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9707occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 8823 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 35508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...