./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ccb5cdd0373226e681809d7804324f4019c28126fdbac8b5748755015258b65 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:45,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:45,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:45,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:45,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:45,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:45,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:45,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:45,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:45,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:45,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:45,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:45,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:45,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:45,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:45,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:45,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:45,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:45,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:45,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:45,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:45,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:45,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:45,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:45,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:45,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:45,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:45,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:45,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:45,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:45,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:45,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:45,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:45,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:45,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:45,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:45,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:45,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:45,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:45,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:45,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:45,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:40:45,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:45,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:45,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:45,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:45,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:45,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:45,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:45,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:45,934 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:45,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:45,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:45,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:45,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:45,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:45,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:45,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:45,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:45,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:45,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:45,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:45,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:45,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:45,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:45,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:45,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:45,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:45,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:45,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:45,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:45,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:45,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:45,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:45,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:45,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ccb5cdd0373226e681809d7804324f4019c28126fdbac8b5748755015258b65 [2022-02-20 20:40:46,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:46,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:46,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:46,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:46,276 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:46,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i [2022-02-20 20:40:46,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd8da3fb/f2c6ac14fc6e41178f63cb47467068e6/FLAG3981077e3 [2022-02-20 20:40:47,072 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:47,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i [2022-02-20 20:40:47,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd8da3fb/f2c6ac14fc6e41178f63cb47467068e6/FLAG3981077e3 [2022-02-20 20:40:47,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd8da3fb/f2c6ac14fc6e41178f63cb47467068e6 [2022-02-20 20:40:47,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:47,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:47,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:47,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:47,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:47,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b75d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47, skipping insertion in model container [2022-02-20 20:40:47,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:47,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:47,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i[1088,1101] [2022-02-20 20:40:47,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:47,509 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:47,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_40-traces-ex-6_true.i[1088,1101] [2022-02-20 20:40:47,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:47,581 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:47,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47 WrapperNode [2022-02-20 20:40:47,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:47,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:47,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:47,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:47,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,630 INFO L137 Inliner]: procedures = 162, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 20:40:47,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:47,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:47,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:47,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:47,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:47,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:47,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:47,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:47,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (1/1) ... [2022-02-20 20:40:47,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:47,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:40:47,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:40:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:47,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:47,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:47,766 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:40:47,892 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:47,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:48,092 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:48,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:48,098 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:48,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:48 BoogieIcfgContainer [2022-02-20 20:40:48,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:48,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:48,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:48,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:48,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:47" (1/3) ... [2022-02-20 20:40:48,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c41326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:48, skipping insertion in model container [2022-02-20 20:40:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:47" (2/3) ... [2022-02-20 20:40:48,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c41326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:48, skipping insertion in model container [2022-02-20 20:40:48,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:48" (3/3) ... [2022-02-20 20:40:48,114 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_40-traces-ex-6_true.i [2022-02-20 20:40:48,117 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:48,117 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:48,118 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:48,118 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:48,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,168 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,168 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,169 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,169 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,178 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,179 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:48,182 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:48,216 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:48,221 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:40:48,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:48,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 67 transitions, 139 flow [2022-02-20 20:40:48,290 INFO L129 PetriNetUnfolder]: 1/66 cut-off events. [2022-02-20 20:40:48,291 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:48,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 66 events. 1/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2022-02-20 20:40:48,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 67 transitions, 139 flow [2022-02-20 20:40:48,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 115 flow [2022-02-20 20:40:48,362 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2022-02-20 20:40:48,378 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:48,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:48,379 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:48,380 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 412301319, now seen corresponding path program 1 times [2022-02-20 20:40:48,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:48,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955338379] [2022-02-20 20:40:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:48,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} [106] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {73#true} is VALID [2022-02-20 20:40:48,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {73#true} [126] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {73#true} [130] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#true} [91] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#true} [121] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {73#true} [112] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {73#true} [115] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:40:48,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {73#true} [116] L18-4-->L682: Formula: (= 2 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {75#(= 2 ~g~0)} [75] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {75#(= 2 ~g~0)} [92] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {75#(= 2 ~g~0)} [77] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {75#(= 2 ~g~0)} [129] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {75#(= 2 ~g~0)} [101] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {75#(= 2 ~g~0)} [135] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {75#(= 2 ~g~0)} [85] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {75#(= 2 ~g~0)} [122] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {75#(= 2 ~g~0)} [78] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {75#(= 2 ~g~0)} [119] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {75#(= 2 ~g~0)} [104] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {75#(= 2 ~g~0)} [123] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {75#(= 2 ~g~0)} [74] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {75#(= 2 ~g~0)} [124] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {75#(= 2 ~g~0)} [102] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {75#(= 2 ~g~0)} [134] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {75#(= 2 ~g~0)} [114] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {75#(= 2 ~g~0)} [83] L-1-5-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {75#(= 2 ~g~0)} [87] L694-->L694-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {75#(= 2 ~g~0)} [110] L694-1-->L695: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {75#(= 2 ~g~0)} [132] L695-->L695-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {75#(= 2 ~g~0)} [105] L695-1-->L695-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {75#(= 2 ~g~0)} [151] L695-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {75#(= 2 ~g~0)} [76] L695-3-->L695-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {75#(= 2 ~g~0)} [95] L695-4-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {75#(= 2 ~g~0)} [117] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#D~0.base_7|))) (and (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {75#(= 2 ~g~0)} [103] L696-1-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {75#(= 2 ~g~0)} [97] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {75#(= 2 ~g~0)} [84] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {75#(= 2 ~g~0)} [94] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#D~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#D~0.base_8|) |v_~#D~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {75#(= 2 ~g~0)} [109] L699-->L699-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:40:48,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {75#(= 2 ~g~0)} [86] L699-1-->L699-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {76#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:48,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {76#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [79] L699-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {76#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:48,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {76#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [96] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {77#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:48,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {77#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [88] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {74#false} is VALID [2022-02-20 20:40:48,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {74#false} [99] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74#false} is VALID [2022-02-20 20:40:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:48,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:48,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955338379] [2022-02-20 20:40:48,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955338379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:48,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:48,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:48,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501446006] [2022-02-20 20:40:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 20:40:48,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:48,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:49,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:49,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:49,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 67 [2022-02-20 20:40:49,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:49,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 67 [2022-02-20 20:40:49,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:49,154 INFO L129 PetriNetUnfolder]: 8/91 cut-off events. [2022-02-20 20:40:49,155 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:49,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 91 events. 8/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 148 event pairs, 0 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 86. Up to 10 conditions per place. [2022-02-20 20:40:49,157 INFO L132 encePairwiseOnDemand]: 61/67 looper letters, 8 selfloop transitions, 3 changer transitions 9/68 dead transitions. [2022-02-20 20:40:49,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 179 flow [2022-02-20 20:40:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 414 transitions. [2022-02-20 20:40:49,187 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827292110874201 [2022-02-20 20:40:49,188 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 414 transitions. [2022-02-20 20:40:49,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 414 transitions. [2022-02-20 20:40:49,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:49,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 414 transitions. [2022-02-20 20:40:49,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 59.142857142857146) internal successors, (414), 7 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,200 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,202 INFO L186 Difference]: Start difference. First operand has 60 places, 56 transitions, 115 flow. Second operand 7 states and 414 transitions. [2022-02-20 20:40:49,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 179 flow [2022-02-20 20:40:49,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:49,210 INFO L242 Difference]: Finished difference. Result has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:49,211 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-02-20 20:40:49,213 INFO L334 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2022-02-20 20:40:49,214 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:49,232 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 170 states, 168 states have (on average 1.6547619047619047) internal successors, (278), 169 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,235 INFO L78 Accepts]: Start accepts. Automaton has has 170 states, 168 states have (on average 1.6547619047619047) internal successors, (278), 169 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 20:40:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:49,235 INFO L470 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:49,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:49,236 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:49,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:49,237 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2088866876, now seen corresponding path program 1 times [2022-02-20 20:40:49,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:49,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818089353] [2022-02-20 20:40:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:49,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} [106] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {261#true} is VALID [2022-02-20 20:40:49,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} [126] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} [130] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} [91] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} [121] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#true} [112] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#true} [115] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {261#true} is VALID [2022-02-20 20:40:49,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#true} [116] L18-4-->L682: Formula: (= 2 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {261#true} is VALID [2022-02-20 20:40:49,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#true} [75] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(<= |~#A~0.base| 3)} [92] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#(<= |~#A~0.base| 3)} [77] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {263#(<= |~#A~0.base| 3)} [129] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {263#(<= |~#A~0.base| 3)} [101] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {263#(<= |~#A~0.base| 3)} [135] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {263#(<= |~#A~0.base| 3)} [85] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {263#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {263#(<= |~#A~0.base| 3)} [122] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [78] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [119] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [104] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [123] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [74] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [124] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [102] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [134] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [114] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [83] L-1-5-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [87] L694-->L694-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [110] L694-1-->L695: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [132] L695-->L695-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [105] L695-1-->L695-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [151] L695-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [139] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {264#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {264#(not (= |~#A~0.base| |~#D~0.base|))} [140] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#D~0.base_10|))) (and (= (select .cse0 |v_~#D~0.offset_10|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#D~0.base_10| (store .cse0 |v_~#D~0.offset_10| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {265#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {265#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [141] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {265#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {265#(and (= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [142] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#A~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#A~0.base_8| (store .cse0 |v_~#A~0.offset_8| 1))) (= (select .cse0 |v_~#A~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:49,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [143] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:49,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [144] L687-->L688: Formula: (= v_~g~0_3 1) InVars {} OutVars{~g~0=v_~g~0_3} AuxVars[] AssignedVars[~g~0] {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:49,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [76] L695-3-->L695-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:49,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [95] L695-4-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} is VALID [2022-02-20 20:40:49,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {266#(= (select (select |#pthreadsMutex| |~#D~0.base|) |~#D~0.offset|) 1)} [117] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#D~0.base_7|))) (and (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {262#false} is VALID [2022-02-20 20:40:49,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {262#false} [103] L696-1-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {262#false} is VALID [2022-02-20 20:40:49,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {262#false} [97] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {262#false} is VALID [2022-02-20 20:40:49,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {262#false} [84] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {262#false} is VALID [2022-02-20 20:40:49,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {262#false} [94] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#D~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#D~0.base_8|) |v_~#D~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {262#false} is VALID [2022-02-20 20:40:49,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {262#false} [109] L699-->L699-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#false} is VALID [2022-02-20 20:40:49,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {262#false} [86] L699-1-->L699-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {262#false} is VALID [2022-02-20 20:40:49,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {262#false} [79] L699-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {262#false} is VALID [2022-02-20 20:40:49,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {262#false} [96] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {262#false} is VALID [2022-02-20 20:40:49,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {262#false} [88] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {262#false} is VALID [2022-02-20 20:40:49,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {262#false} [99] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#false} is VALID [2022-02-20 20:40:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:49,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:49,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818089353] [2022-02-20 20:40:49,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818089353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:49,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:49,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:49,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77690970] [2022-02-20 20:40:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:49,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 20:40:49,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:49,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:49,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:49,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:49,467 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 67 [2022-02-20 20:40:49,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:49,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 67 [2022-02-20 20:40:49,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:49,584 INFO L129 PetriNetUnfolder]: 1/75 cut-off events. [2022-02-20 20:40:49,584 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:40:49,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 75 events. 1/75 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 1 based on Foata normal form. 5/80 useless extension candidates. Maximal degree in co-relation 114. Up to 12 conditions per place. [2022-02-20 20:40:49,585 INFO L132 encePairwiseOnDemand]: 61/67 looper letters, 14 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2022-02-20 20:40:49,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 56 transitions, 173 flow [2022-02-20 20:40:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2022-02-20 20:40:49,588 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2022-02-20 20:40:49,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:49,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,590 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,590 INFO L186 Difference]: Start difference. First operand has 70 places, 56 transitions, 133 flow. Second operand 5 states and 247 transitions. [2022-02-20 20:40:49,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 56 transitions, 173 flow [2022-02-20 20:40:49,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 159 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-02-20 20:40:49,592 INFO L242 Difference]: Finished difference. Result has 64 places, 56 transitions, 131 flow [2022-02-20 20:40:49,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2022-02-20 20:40:49,593 INFO L334 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2022-02-20 20:40:49,593 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 56 transitions, 131 flow [2022-02-20 20:40:49,595 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 142 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 141 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,595 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 141 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 20:40:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:49,596 INFO L470 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 131 flow [2022-02-20 20:40:49,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,596 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:49,596 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:49,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:49,597 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 35787268, now seen corresponding path program 2 times [2022-02-20 20:40:49,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:49,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254582808] [2022-02-20 20:40:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:49,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#true} [106] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {415#true} is VALID [2022-02-20 20:40:49,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#true} [126] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {415#true} [130] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {415#true} [91] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#true} [121] L18-1-->L18-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {415#true} [112] L18-2-->L18-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#true} [115] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {415#true} is VALID [2022-02-20 20:40:49,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {415#true} [116] L18-4-->L682: Formula: (= 2 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {415#true} is VALID [2022-02-20 20:40:49,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#true} [75] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#(<= |~#A~0.base| 3)} [92] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#(<= |~#A~0.base| 3)} [77] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#(<= |~#A~0.base| 3)} [129] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#(<= |~#A~0.base| 3)} [101] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#(<= |~#A~0.base| 3)} [135] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#(<= |~#A~0.base| 3)} [85] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {417#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:49,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#(<= |~#A~0.base| 3)} [122] L682-7-->L683: Formula: (and (= |v_~#D~0.offset_1| 0) (= |v_~#D~0.base_1| 4)) InVars {} OutVars{~#D~0.offset=|v_~#D~0.offset_1|, ~#D~0.base=|v_~#D~0.base_1|} AuxVars[] AssignedVars[~#D~0.base, ~#D~0.offset] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [78] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [119] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#D~0.base_2|) |v_~#D~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#D~0.base=|v_~#D~0.base_2|, ~#D~0.offset=|v_~#D~0.offset_2|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [104] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#D~0.base_3|) (+ |v_~#D~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#D~0.base=|v_~#D~0.base_3|, ~#D~0.offset=|v_~#D~0.offset_3|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [123] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#D~0.base_4|) (+ |v_~#D~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#D~0.base=|v_~#D~0.base_4|, ~#D~0.offset=|v_~#D~0.offset_4|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [74] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#D~0.base_5|) (+ |v_~#D~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#D~0.base=|v_~#D~0.base_5|, ~#D~0.offset=|v_~#D~0.offset_5|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [124] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#D~0.base_6|) (+ |v_~#D~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#D~0.base=|v_~#D~0.base_6|, ~#D~0.offset=|v_~#D~0.offset_6|} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [102] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [134] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [114] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [83] L-1-5-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [87] L694-->L694-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [110] L694-1-->L695: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [132] L695-->L695-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [105] L695-1-->L695-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [151] L695-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [76] L695-3-->L695-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [95] L695-4-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [117] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#D~0.base_7|))) (and (= (select .cse0 |v_~#D~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#D~0.base_7| (store .cse0 |v_~#D~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#D~0.base=|v_~#D~0.base_7|, ~#D~0.offset=|v_~#D~0.offset_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [103] L696-1-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {418#(not (= |~#A~0.base| |~#D~0.base|))} is VALID [2022-02-20 20:40:49,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {418#(not (= |~#A~0.base| |~#D~0.base|))} [97] L697-->L697-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [84] L697-1-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [94] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#D~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#D~0.base_8|) |v_~#D~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#D~0.base=|v_~#D~0.base_8|, ~#D~0.offset=|v_~#D~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [109] L699-->L699-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [139] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} is VALID [2022-02-20 20:40:49,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {419#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#A~0.base| |~#D~0.base|)))} [140] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#D~0.base_10|))) (and (= (select .cse0 |v_~#D~0.offset_10|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0) (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#D~0.base_10| (store .cse0 |v_~#D~0.offset_10| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {420#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:49,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {420#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [141] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {420#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:49,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {420#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [142] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#A~0.base_8|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#A~0.base_8| (store .cse0 |v_~#A~0.offset_8| 1))) (= (select .cse0 |v_~#A~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#A~0.offset=|v_~#A~0.offset_8|, ~#A~0.base=|v_~#A~0.base_8|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {416#false} is VALID [2022-02-20 20:40:49,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {416#false} [143] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {416#false} is VALID [2022-02-20 20:40:49,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {416#false} [144] L687-->L688: Formula: (= v_~g~0_3 1) InVars {} OutVars{~g~0=v_~g~0_3} AuxVars[] AssignedVars[~g~0] {416#false} is VALID [2022-02-20 20:40:49,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {416#false} [86] L699-1-->L699-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_2) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {416#false} is VALID [2022-02-20 20:40:49,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {416#false} [79] L699-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {416#false} is VALID [2022-02-20 20:40:49,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {416#false} [96] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {416#false} is VALID [2022-02-20 20:40:49,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {416#false} [88] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {416#false} is VALID [2022-02-20 20:40:49,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {416#false} [99] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#false} is VALID [2022-02-20 20:40:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:49,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:49,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254582808] [2022-02-20 20:40:49,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254582808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:49,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:49,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:49,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338044775] [2022-02-20 20:40:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:49,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 20:40:49,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:49,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:49,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:49,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:49,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:49,728 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 67 [2022-02-20 20:40:49,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:49,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 67 [2022-02-20 20:40:49,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:49,805 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-02-20 20:40:49,805 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-02-20 20:40:49,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 59 events. 0/59 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2022-02-20 20:40:49,805 INFO L132 encePairwiseOnDemand]: 62/67 looper letters, 0 selfloop transitions, 0 changer transitions 52/52 dead transitions. [2022-02-20 20:40:49,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 165 flow [2022-02-20 20:40:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2022-02-20 20:40:49,808 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2022-02-20 20:40:49,808 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:49,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2022-02-20 20:40:49,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,810 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,811 INFO L186 Difference]: Start difference. First operand has 64 places, 56 transitions, 131 flow. Second operand 5 states and 247 transitions. [2022-02-20 20:40:49,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 165 flow [2022-02-20 20:40:49,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 154 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:40:49,812 INFO L242 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2022-02-20 20:40:49,812 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2022-02-20 20:40:49,813 INFO L334 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2022-02-20 20:40:49,813 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 0 transitions, 0 flow [2022-02-20 20:40:49,813 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 20:40:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:49,813 INFO L470 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2022-02-20 20:40:49,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:49,816 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:49,816 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:49,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:49,818 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1] [2022-02-20 20:40:49,820 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:49,820 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:49,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:49 BasicIcfg [2022-02-20 20:40:49,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:49,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:49,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:49,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:49,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:48" (3/4) ... [2022-02-20 20:40:49,825 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:49,828 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:40:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:49,851 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:49,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:49,852 INFO L158 Benchmark]: Toolchain (without parser) took 2709.82ms. Allocated memory was 96.5MB in the beginning and 161.5MB in the end (delta: 65.0MB). Free memory was 64.2MB in the beginning and 73.8MB in the end (delta: -9.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,852 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:49,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.87ms. Allocated memory was 96.5MB in the beginning and 161.5MB in the end (delta: 65.0MB). Free memory was 64.0MB in the beginning and 126.5MB in the end (delta: -62.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.58ms. Allocated memory is still 161.5MB. Free memory was 126.5MB in the beginning and 124.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,853 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 161.5MB. Free memory was 124.5MB in the beginning and 123.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,854 INFO L158 Benchmark]: RCFGBuilder took 432.87ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 110.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,854 INFO L158 Benchmark]: TraceAbstraction took 1720.05ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 75.9MB in the end (delta: 34.4MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,854 INFO L158 Benchmark]: Witness Printer took 29.02ms. Allocated memory is still 161.5MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:49,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.87ms. Allocated memory was 96.5MB in the beginning and 161.5MB in the end (delta: 65.0MB). Free memory was 64.0MB in the beginning and 126.5MB in the end (delta: -62.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.58ms. Allocated memory is still 161.5MB. Free memory was 126.5MB in the beginning and 124.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 161.5MB. Free memory was 124.5MB in the beginning and 123.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.87ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 110.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1720.05ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 75.9MB in the end (delta: 34.4MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 29.02ms. Allocated memory is still 161.5MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 80 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 14 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=1, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:49,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE