./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-2.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_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85b94be996486a7516ccc33e88e36127bb614ed5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:47:07,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:47:07,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:47:07,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:47:07,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:47:07,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:47:07,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:47:07,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:47:07,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:47:07,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:47:07,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:47:07,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:47:07,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:47:07,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:47:07,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:47:07,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:47:07,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:47:07,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:47:07,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:47:07,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:47:07,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:47:07,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:47:07,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:47:07,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:47:07,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:47:07,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:47:07,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:47:07,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:47:07,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:47:07,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:47:07,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:47:07,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:47:07,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:47:07,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:47:07,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:47:07,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:47:07,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:47:07,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:47:07,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:47:07,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:47:07,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:47:07,114 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:47:07,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:47:07,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:47:07,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:47:07,124 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:47:07,124 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:47:07,124 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:47:07,124 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:47:07,124 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:47:07,124 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:47:07,125 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:47:07,125 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:47:07,125 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:47:07,125 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:47:07,125 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:47:07,125 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:47:07,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:47:07,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:47:07,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:47:07,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:47:07,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:47:07,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:47:07,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:47:07,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:47:07,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:47:07,128 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan 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 -> Taipan 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 -> 85b94be996486a7516ccc33e88e36127bb614ed5 [2019-12-07 20:47:07,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:47:07,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:47:07,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:47:07,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:47:07,239 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:47:07,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longer-2.i [2019-12-07 20:47:07,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/data/7325e59b0/f4c0ebb62fcf460c81c4371ce8866fe7/FLAG6c6870f9a [2019-12-07 20:47:07,654 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:47:07,655 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/sv-benchmarks/c/pthread/triangular-longer-2.i [2019-12-07 20:47:07,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/data/7325e59b0/f4c0ebb62fcf460c81c4371ce8866fe7/FLAG6c6870f9a [2019-12-07 20:47:07,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/data/7325e59b0/f4c0ebb62fcf460c81c4371ce8866fe7 [2019-12-07 20:47:07,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:47:07,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:47:07,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:07,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:47:07,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:47:07,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:07" (1/1) ... [2019-12-07 20:47:07,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d2a91f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:07, skipping insertion in model container [2019-12-07 20:47:07,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:07" (1/1) ... [2019-12-07 20:47:07,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:47:07,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:47:07,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:07,944 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:47:07,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:08,021 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:47:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08 WrapperNode [2019-12-07 20:47:08,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:08,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:08,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:47:08,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:47:08,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:08,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:47:08,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:47:08,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:47:08,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... [2019-12-07 20:47:08,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:47:08,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:47:08,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:47:08,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:47:08,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/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 20:47:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-07 20:47:08,128 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-07 20:47:08,128 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-07 20:47:08,128 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:47:08,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:47:08,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:47:08,130 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:47:08,295 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:47:08,296 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 20:47:08,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:08 BoogieIcfgContainer [2019-12-07 20:47:08,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:47:08,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:47:08,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:47:08,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:47:08,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:47:07" (1/3) ... [2019-12-07 20:47:08,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d37baf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:08, skipping insertion in model container [2019-12-07 20:47:08,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:08" (2/3) ... [2019-12-07 20:47:08,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d37baf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:08, skipping insertion in model container [2019-12-07 20:47:08,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:08" (3/3) ... [2019-12-07 20:47:08,301 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2019-12-07 20:47:08,307 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:47:08,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:47:08,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:47:08,311 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:47:08,328 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,328 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,328 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,328 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,329 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,330 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,331 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,331 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,331 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,331 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,331 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,332 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,332 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,332 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,332 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,332 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:47:08,348 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 20:47:08,361 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:47:08,361 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:47:08,361 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:47:08,361 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:47:08,362 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:47:08,362 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:47:08,362 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:47:08,362 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:47:08,373 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-07 20:47:08,374 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 20:47:08,401 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 20:47:08,402 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:47:08,405 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 20:47:08,407 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 20:47:08,415 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 20:47:08,415 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:47:08,416 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 20:47:08,417 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-07 20:47:08,418 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:47:09,068 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-07 20:47:09,068 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-07 20:47:09,070 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-07 20:47:09,077 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-07 20:47:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 20:47:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:47:09,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:09,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:47:09,083 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-07 20:47:09,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:09,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402140553] [2019-12-07 20:47:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:09,248 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 20:47:09,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402140553] [2019-12-07 20:47:09,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:09,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:47:09,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494190190] [2019-12-07 20:47:09,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:09,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:09,264 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 20:47:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:09,286 INFO L93 Difference]: Finished difference Result 44 states and 107 transitions. [2019-12-07 20:47:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:09,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:47:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:09,295 INFO L225 Difference]: With dead ends: 44 [2019-12-07 20:47:09,295 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 20:47:09,296 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 20:47:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 20:47:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 20:47:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:47:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2019-12-07 20:47:09,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 5 [2019-12-07 20:47:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:09,320 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 56 transitions. [2019-12-07 20:47:09,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 56 transitions. [2019-12-07 20:47:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:47:09,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:09,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:09,321 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 232910220, now seen corresponding path program 1 times [2019-12-07 20:47:09,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:09,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329720841] [2019-12-07 20:47:09,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:09,380 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 20:47:09,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329720841] [2019-12-07 20:47:09,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:09,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:47:09,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195332227] [2019-12-07 20:47:09,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:09,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:09,382 INFO L87 Difference]: Start difference. First operand 26 states and 56 transitions. Second operand 4 states. [2019-12-07 20:47:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:09,411 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-07 20:47:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:47:09,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:47:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:09,412 INFO L225 Difference]: With dead ends: 40 [2019-12-07 20:47:09,412 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 20:47:09,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 20:47:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 20:47:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-12-07 20:47:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:47:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-07 20:47:09,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 7 [2019-12-07 20:47:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:09,418 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-07 20:47:09,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-07 20:47:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:47:09,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:09,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:09,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-07 20:47:09,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:09,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002604614] [2019-12-07 20:47:09,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:09,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002604614] [2019-12-07 20:47:09,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:09,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:09,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112085332] [2019-12-07 20:47:09,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:47:09,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:47:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:47:09,483 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 5 states. [2019-12-07 20:47:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:09,512 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-07 20:47:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:47:09,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 20:47:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:09,513 INFO L225 Difference]: With dead ends: 34 [2019-12-07 20:47:09,513 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:47:09,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:47:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:47:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 20:47:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 20:47:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-07 20:47:09,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-07 20:47:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:09,519 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-07 20:47:09,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:47:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-07 20:47:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:47:09,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:09,520 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:09,521 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 2 times [2019-12-07 20:47:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:09,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517349164] [2019-12-07 20:47:09,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:09,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517349164] [2019-12-07 20:47:09,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688469839] [2019-12-07 20:47:09,586 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:09,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 20:47:09,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:47:09,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:47:09,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:47:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:09,657 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:47:09,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:09,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:09,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [783102244] [2019-12-07 20:47:09,698 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:47:09,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:47:09,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-12-07 20:47:09,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767862891] [2019-12-07 20:47:09,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:47:09,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:47:09,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:47:09,700 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 11 states. [2019-12-07 20:47:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:09,772 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-07 20:47:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:47:09,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-12-07 20:47:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:09,774 INFO L225 Difference]: With dead ends: 44 [2019-12-07 20:47:09,774 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 20:47:09,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:47:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 20:47:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-12-07 20:47:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 20:47:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-07 20:47:09,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 10 [2019-12-07 20:47:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-07 20:47:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:47:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-07 20:47:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:47:09,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:09,780 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:09,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:09,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1575173822, now seen corresponding path program 3 times [2019-12-07 20:47:09,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:09,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620159998] [2019-12-07 20:47:09,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620159998] [2019-12-07 20:47:10,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190463543] [2019-12-07 20:47:10,076 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:10,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:47:10,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:47:10,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:47:10,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:47:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,122 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:47:10,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62479274] [2019-12-07 20:47:10,165 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:47:10,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:47:10,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2019-12-07 20:47:10,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090129157] [2019-12-07 20:47:10,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:47:10,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:47:10,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:47:10,166 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 14 states. [2019-12-07 20:47:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:10,311 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-07 20:47:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:47:10,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-12-07 20:47:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:10,312 INFO L225 Difference]: With dead ends: 73 [2019-12-07 20:47:10,312 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 20:47:10,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=360, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:47:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 20:47:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-12-07 20:47:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 20:47:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-07 20:47:10,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 13 [2019-12-07 20:47:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:10,318 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-07 20:47:10,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:47:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-07 20:47:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:47:10,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:10,319 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:10,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:10,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1577093909, now seen corresponding path program 4 times [2019-12-07 20:47:10,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:10,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727153887] [2019-12-07 20:47:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727153887] [2019-12-07 20:47:10,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523976295] [2019-12-07 20:47:10,662 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:10,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:47:10,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:47:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,713 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:47:10,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:47:10,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2221545] [2019-12-07 20:47:10,814 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:47:10,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:47:10,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2019-12-07 20:47:10,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795741339] [2019-12-07 20:47:10,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:47:10,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:47:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:47:10,816 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 21 states. [2019-12-07 20:47:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:11,066 INFO L93 Difference]: Finished difference Result 98 states and 198 transitions. [2019-12-07 20:47:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:47:11,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2019-12-07 20:47:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:11,068 INFO L225 Difference]: With dead ends: 98 [2019-12-07 20:47:11,068 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 20:47:11,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=440, Invalid=892, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 20:47:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 20:47:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2019-12-07 20:47:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:47:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-07 20:47:11,072 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 16 [2019-12-07 20:47:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:11,072 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-07 20:47:11,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:47:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-07 20:47:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:47:11,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:11,073 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:11,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:11,275 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 5 times [2019-12-07 20:47:11,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:11,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684257201] [2019-12-07 20:47:11,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:11,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684257201] [2019-12-07 20:47:11,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99137236] [2019-12-07 20:47:11,452 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:11,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 20:47:11,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:47:11,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 20:47:11,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:47:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:11,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:47:11,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:11,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:47:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:11,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533537097] [2019-12-07 20:47:11,672 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:47:11,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:47:11,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2019-12-07 20:47:11,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868254880] [2019-12-07 20:47:11,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 20:47:11,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 20:47:11,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2019-12-07 20:47:11,674 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 26 states. [2019-12-07 20:47:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:12,017 INFO L93 Difference]: Finished difference Result 83 states and 168 transitions. [2019-12-07 20:47:12,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:47:12,017 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 23 [2019-12-07 20:47:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:12,018 INFO L225 Difference]: With dead ends: 83 [2019-12-07 20:47:12,018 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 20:47:12,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=752, Invalid=1504, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 20:47:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 20:47:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2019-12-07 20:47:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 20:47:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2019-12-07 20:47:12,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 23 [2019-12-07 20:47:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:12,023 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2019-12-07 20:47:12,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 20:47:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2019-12-07 20:47:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:47:12,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:12,023 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:12,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:47:12,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 6 times [2019-12-07 20:47:12,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:12,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896446612] [2019-12-07 20:47:12,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:47:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:47:12,299 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:47:12,300 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:47:12,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-07 20:47:12,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_2 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_2 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_2, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_2, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_2) (= v_t2Thread1of1ForFork0_~arg.offset_2 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_2, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_2, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start_main_~condJ~0_15 (ite (<= 26 v_~j~0_27) 1 0)) (or (not (= v_ULTIMATE.start_main_~condI~0_15 0)) (not (= v_ULTIMATE.start_main_~condJ~0_15 0))) (= v_ULTIMATE.start_main_~condI~0_15 (ite (<= 26 v_~i~0_25) 1 0))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-07 20:47:12,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:47:12 BasicIcfg [2019-12-07 20:47:12,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:47:12,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:47:12,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:47:12,315 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:47:12,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:08" (3/4) ... [2019-12-07 20:47:12,317 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:47:12,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-07 20:47:12,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-07 20:47:12,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_2 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_2 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_2, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_2, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_2) (= v_t2Thread1of1ForFork0_~arg.offset_2 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_2, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_2, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_18 10) (= (+ v_~j~0_25 1) v_~i~0_23) (= v_t1Thread1of1ForFork1_~k~0_17 (+ v_t1Thread1of1ForFork1_~k~0_18 1))) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_18} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_11|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_17} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-07 20:47:12,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (< v_t2Thread1of1ForFork0_~k~1_32 10) (= (+ v_t2Thread1of1ForFork0_~k~1_32 1) v_t2Thread1of1ForFork0_~k~1_31)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_32} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_10|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_31} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-07 20:47:12,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start_main_~condJ~0_15 (ite (<= 26 v_~j~0_27) 1 0)) (or (not (= v_ULTIMATE.start_main_~condI~0_15 0)) (not (= v_ULTIMATE.start_main_~condJ~0_15 0))) (= v_ULTIMATE.start_main_~condI~0_15 (ite (<= 26 v_~i~0_25) 1 0))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-07 20:47:12,344 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c6713c8-02d7-4883-82f1-744d5617803b/bin/utaipan/witness.graphml [2019-12-07 20:47:12,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:47:12,345 INFO L168 Benchmark]: Toolchain (without parser) took 4669.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.2 MB in the beginning and 962.1 MB in the end (delta: -23.9 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:12,345 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:47:12,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:12,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.49 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 20:47:12,346 INFO L168 Benchmark]: Boogie Preprocessor took 20.97 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 20:47:12,347 INFO L168 Benchmark]: RCFGBuilder took 222.03 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:12,347 INFO L168 Benchmark]: TraceAbstraction took 4017.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.0 GB in the beginning and 970.3 MB in the end (delta: 71.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:12,348 INFO L168 Benchmark]: Witness Printer took 29.16 ms. Allocated memory is still 1.2 GB. Free memory was 970.3 MB in the beginning and 962.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:12,350 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.49 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 20.97 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 222.03 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4017.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.0 GB in the beginning and 970.3 MB in the end (delta: 71.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * Witness Printer took 29.16 ms. Allocated memory is still 1.2 GB. Free memory was 970.3 MB in the beginning and 962.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 10, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 75 SDtfs, 317 SDslu, 199 SDs, 0 SdLazy, 208 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 65 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 9686 SizeOfPredicates, 28 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 6/240 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...