./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-1_2-join.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/ldv-races/race-1_2-join.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 fd4c3d19582748238e9ca587d159d6e8fc23db581cd4de03be73dc785992e03f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:36:21,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:36:21,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:36:21,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:36:21,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:36:21,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:36:21,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:36:21,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:36:21,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:36:21,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:36:21,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:36:21,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:36:21,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:36:21,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:36:21,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:36:21,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:36:21,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:36:21,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:36:21,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:36:21,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:36:21,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:36:21,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:36:21,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:36:21,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:36:21,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:36:21,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:36:21,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:36:21,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:36:21,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:36:21,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:36:21,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:36:21,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:36:21,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:36:21,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:36:21,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:36:21,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:36:21,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:36:21,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:36:21,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:36:21,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:36:21,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:36:21,654 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:36:21,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:36:21,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:36:21,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:36:21,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:36:21,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:36:21,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:36:21,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:36:21,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:36:21,679 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:36:21,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:36:21,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:36:21,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:36:21,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:36:21,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:36:21,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:36:21,683 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:36:21,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:36:21,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:36:21,683 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 -> fd4c3d19582748238e9ca587d159d6e8fc23db581cd4de03be73dc785992e03f [2022-02-20 20:36:21,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:36:21,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:36:21,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:36:21,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:36:21,907 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:36:21,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_2-join.i [2022-02-20 20:36:21,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05299d/7bf8a8acd974415183885dfcf9219986/FLAGaedefc608 [2022-02-20 20:36:22,457 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:36:22,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_2-join.i [2022-02-20 20:36:22,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05299d/7bf8a8acd974415183885dfcf9219986/FLAGaedefc608 [2022-02-20 20:36:22,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa05299d/7bf8a8acd974415183885dfcf9219986 [2022-02-20 20:36:22,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:36:22,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:36:22,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:36:22,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:36:22,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:36:22,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:36:22" (1/1) ... [2022-02-20 20:36:22,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4431e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:22, skipping insertion in model container [2022-02-20 20:36:22,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:36:22" (1/1) ... [2022-02-20 20:36:22,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:36:23,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:36:23,403 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/ldv-races/race-1_2-join.i[76153,76166] [2022-02-20 20:36:23,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:36:23,425 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:36:23,462 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/ldv-races/race-1_2-join.i[76153,76166] [2022-02-20 20:36:23,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:36:23,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:36:23,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23 WrapperNode [2022-02-20 20:36:23,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:36:23,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:36:23,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:36:23,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:36:23,569 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:36:23" (1/1) ... [2022-02-20 20:36:23,614 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:36:23" (1/1) ... [2022-02-20 20:36:23,642 INFO L137 Inliner]: procedures = 482, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2022-02-20 20:36:23,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:36:23,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:36:23,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:36:23,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:36:23,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:36:23,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:36:23,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:36:23,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:36:23,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (1/1) ... [2022-02-20 20:36:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:36:23,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:36:23,736 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:36:23,751 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:36:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:36:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:36:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:36:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:36:23,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:36:23,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:36:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:36:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:36:23,764 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:36:23,971 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:36:23,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:36:24,082 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:36:24,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:36:24,097 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:36:24,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:24 BoogieIcfgContainer [2022-02-20 20:36:24,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:36:24,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:36:24,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:36:24,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:36:24,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:36:22" (1/3) ... [2022-02-20 20:36:24,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434b904c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:36:24, skipping insertion in model container [2022-02-20 20:36:24,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:23" (2/3) ... [2022-02-20 20:36:24,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434b904c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:36:24, skipping insertion in model container [2022-02-20 20:36:24,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:24" (3/3) ... [2022-02-20 20:36:24,107 INFO L111 eAbstractionObserver]: Analyzing ICFG race-1_2-join.i [2022-02-20 20:36:24,110 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:36:24,110 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:36:24,111 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 20:36:24,111 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:36:24,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,141 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,147 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,147 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:24,151 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:36:24,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:36:24,182 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:36:24,183 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:36:24,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 106 transitions, 220 flow [2022-02-20 20:36:24,223 INFO L129 PetriNetUnfolder]: 4/120 cut-off events. [2022-02-20 20:36:24,224 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:36:24,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 120 events. 4/120 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 3 conditions per place. [2022-02-20 20:36:24,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 106 transitions, 220 flow [2022-02-20 20:36:24,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 87 transitions, 180 flow [2022-02-20 20:36:24,238 INFO L129 PetriNetUnfolder]: 1/36 cut-off events. [2022-02-20 20:36:24,238 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:36:24,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:24,239 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] [2022-02-20 20:36:24,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:36:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1430332822, now seen corresponding path program 1 times [2022-02-20 20:36:24,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:24,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558188024] [2022-02-20 20:36:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:24,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} [250] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} [192] 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] {108#true} is VALID [2022-02-20 20:36:24,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} [254] 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[] {108#true} is VALID [2022-02-20 20:36:24,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} [257] L-1-2-->L1693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {108#true} [239] L1693-->L1693-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[] {108#true} is VALID [2022-02-20 20:36:24,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {108#true} [253] L1693-1-->L1693-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[] {108#true} is VALID [2022-02-20 20:36:24,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} [224] L1693-2-->L1693-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[] {108#true} is VALID [2022-02-20 20:36:24,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#true} [202] L1693-3-->L1693-4: Formula: (and (= 16 (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[] {108#true} is VALID [2022-02-20 20:36:24,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {108#true} [251] L1693-4-->L1696: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {108#true} is VALID [2022-02-20 20:36:24,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#true} [188] L1696-->L1696-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#true} [189] L1696-1-->L1696-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#true} [172] L1696-2-->L1697: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {108#true} is VALID [2022-02-20 20:36:24,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#true} [190] L1697-->L1697-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[] {108#true} is VALID [2022-02-20 20:36:24,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {108#true} [199] L1697-1-->L1697-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#true} [173] L1697-2-->L1697-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {108#true} [201] L1697-3-->L1697-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {108#true} [180] L1697-4-->L1697-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {108#true} [236] L1697-5-->L1697-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {108#true} [176] L1697-6-->L-1-3: Formula: (= v_~pdev~0_2 0) InVars {} OutVars{~pdev~0=v_~pdev~0_2} AuxVars[] AssignedVars[~pdev~0] {108#true} is VALID [2022-02-20 20:36:24,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {108#true} [258] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {108#true} [195] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {108#true} [174] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {108#true} is VALID [2022-02-20 20:36:24,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {108#true} [242] L-1-6-->L1734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {108#true} is VALID [2022-02-20 20:36:24,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {108#true} [235] L1734-->L1734-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 20:36:24,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {108#true} [223] L1734-1-->L1734-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {108#true} is VALID [2022-02-20 20:36:24,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {108#true} [161] L1734-2-->L1708: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {108#true} is VALID [2022-02-20 20:36:24,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {108#true} [179] L1708-->L1709: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {108#true} is VALID [2022-02-20 20:36:24,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {108#true} [229] L1709-->L1710: Formula: (= v_~pdev~0_3 1) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {110#(= ~pdev~0 1)} is VALID [2022-02-20 20:36:24,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {110#(= ~pdev~0 1)} [231] L1710-->L1710-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(= ~pdev~0 1)} is VALID [2022-02-20 20:36:24,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {110#(= ~pdev~0 1)} [204] L1710-1-->L1710-2: Formula: (= (ite (= v_~pdev~0_4 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_4} OutVars{~pdev~0=v_~pdev~0_4, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:24,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [218] L1710-2-->L1695: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:24,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [238] L1695-->L1695-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_2| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {112#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:24,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {112#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} [159] L1695-1-->L1695-2: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_3| 0) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 20:36:24,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {109#false} [163] L1695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 20:36:24,573 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:36:24,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:24,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558188024] [2022-02-20 20:36:24,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558188024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:24,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:24,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:24,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650631010] [2022-02-20 20:36:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 20:36:24,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:24,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:36:24,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:24,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:24,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:24,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:24,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-02-20 20:36:24,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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:36:24,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:24,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-02-20 20:36:24,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:24,790 INFO L129 PetriNetUnfolder]: 3/102 cut-off events. [2022-02-20 20:36:24,791 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:36:24,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 102 events. 3/102 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 1 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-02-20 20:36:24,793 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 14 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2022-02-20 20:36:24,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 228 flow [2022-02-20 20:36:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:36:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:36:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2022-02-20 20:36:24,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7425876010781671 [2022-02-20 20:36:24,837 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 551 transitions. [2022-02-20 20:36:24,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 551 transitions. [2022-02-20 20:36:24,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:24,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 551 transitions. [2022-02-20 20:36:24,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.71428571428571) internal successors, (551), 7 states have internal predecessors, (551), 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:36:24,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 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:36:24,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 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:36:24,853 INFO L186 Difference]: Start difference. First operand has 90 places, 87 transitions, 180 flow. Second operand 7 states and 551 transitions. [2022-02-20 20:36:24,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 228 flow [2022-02-20 20:36:24,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 86 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:36:24,860 INFO L242 Difference]: Finished difference. Result has 92 places, 85 transitions, 202 flow [2022-02-20 20:36:24,861 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2022-02-20 20:36:24,865 INFO L334 CegarLoopForPetriNet]: 90 programPoint places, 2 predicate places. [2022-02-20 20:36:24,866 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 85 transitions, 202 flow [2022-02-20 20:36:24,887 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 189 states, 186 states have (on average 1.575268817204301) internal successors, (293), 188 states have internal predecessors, (293), 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:36:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 189 states, 186 states have (on average 1.575268817204301) internal successors, (293), 188 states have internal predecessors, (293), 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 34 [2022-02-20 20:36:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:24,891 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 202 flow [2022-02-20 20:36:24,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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:36:24,892 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:24,892 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] [2022-02-20 20:36:24,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:36:24,892 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:36:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2117080854, now seen corresponding path program 1 times [2022-02-20 20:36:24,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:24,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209054695] [2022-02-20 20:36:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:25,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#true} [250] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} [192] 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] {311#true} is VALID [2022-02-20 20:36:25,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} [254] 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[] {311#true} is VALID [2022-02-20 20:36:25,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} [257] L-1-2-->L1693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {311#true} [239] L1693-->L1693-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[] {311#true} is VALID [2022-02-20 20:36:25,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#true} [253] L1693-1-->L1693-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[] {311#true} is VALID [2022-02-20 20:36:25,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#true} [224] L1693-2-->L1693-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[] {311#true} is VALID [2022-02-20 20:36:25,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#true} [202] L1693-3-->L1693-4: Formula: (and (= 16 (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[] {311#true} is VALID [2022-02-20 20:36:25,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#true} [251] L1693-4-->L1696: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {311#true} is VALID [2022-02-20 20:36:25,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#true} [188] L1696-->L1696-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {311#true} [189] L1696-1-->L1696-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#true} [172] L1696-2-->L1697: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {311#true} is VALID [2022-02-20 20:36:25,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {311#true} [190] L1697-->L1697-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[] {311#true} is VALID [2022-02-20 20:36:25,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#true} [199] L1697-1-->L1697-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#true} [173] L1697-2-->L1697-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {311#true} [201] L1697-3-->L1697-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {311#true} [180] L1697-4-->L1697-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#true} [236] L1697-5-->L1697-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#true} [176] L1697-6-->L-1-3: Formula: (= v_~pdev~0_2 0) InVars {} OutVars{~pdev~0=v_~pdev~0_2} AuxVars[] AssignedVars[~pdev~0] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {311#true} [258] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {311#true} [195] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {311#true} [174] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#true} [242] L-1-6-->L1734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {311#true} is VALID [2022-02-20 20:36:25,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {311#true} [235] L1734-->L1734-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {311#true} [223] L1734-1-->L1734-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {311#true} is VALID [2022-02-20 20:36:25,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {311#true} [161] L1734-2-->L1708: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {311#true} is VALID [2022-02-20 20:36:25,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {311#true} [179] L1708-->L1709: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {311#true} is VALID [2022-02-20 20:36:25,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {311#true} [229] L1709-->L1710: Formula: (= v_~pdev~0_3 1) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {311#true} is VALID [2022-02-20 20:36:25,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {311#true} [231] L1710-->L1710-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {311#true} [204] L1710-1-->L1710-2: Formula: (= (ite (= v_~pdev~0_4 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_4} OutVars{~pdev~0=v_~pdev~0_4, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {311#true} [218] L1710-2-->L1695: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {311#true} [238] L1695-->L1695-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_2| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {311#true} [160] L1695-1-->L1695-5: Formula: (not (= |v_ULTIMATE.start_ldv_assert_~expression#1_4| 0)) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {311#true} [187] L1695-5-->L1711: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {311#true} [248] L1711-->L1711-1: Formula: (and (<= |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483648))) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {311#true} [194] L1711-1-->L1711-3: Formula: (= |v_ULTIMATE.start_module_init_#t~nondet32#1_5| 0) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_5|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_5|} AuxVars[] AssignedVars[] {311#true} is VALID [2022-02-20 20:36:25,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {311#true} [234] L1711-3-->L1721: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1] {311#true} is VALID [2022-02-20 20:36:25,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {311#true} [228] L1721-->L1722: Formula: (= 3 v_~pdev~0_7) InVars {} OutVars{~pdev~0=v_~pdev~0_7} AuxVars[] AssignedVars[~pdev~0] {313#(= ~pdev~0 3)} is VALID [2022-02-20 20:36:25,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {313#(= ~pdev~0 3)} [245] L1722-->L1722-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#(= ~pdev~0 3)} is VALID [2022-02-20 20:36:25,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {313#(= ~pdev~0 3)} [191] L1722-1-->L1722-2: Formula: (= (ite (= 3 v_~pdev~0_8) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_5|) InVars {~pdev~0=v_~pdev~0_8} OutVars{~pdev~0=v_~pdev~0_8, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {314#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:25,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {314#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [198] L1722-2-->L1695-12: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {314#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:25,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {314#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [233] L1695-12-->L1695-13: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_10| |v_ULTIMATE.start_ldv_assert_#in~expression#1_6|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_6|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_6|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {315#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:25,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {315#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} [220] L1695-13-->L1695-14: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_11| 0) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_11|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_11|} AuxVars[] AssignedVars[] {312#false} is VALID [2022-02-20 20:36:25,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {312#false} [168] L1695-14-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312#false} is VALID [2022-02-20 20:36:25,023 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:36:25,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:25,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209054695] [2022-02-20 20:36:25,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209054695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:25,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:25,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:25,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964016610] [2022-02-20 20:36:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:25,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2022-02-20 20:36:25,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:25,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:36:25,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:25,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:25,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:25,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:25,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 106 [2022-02-20 20:36:25,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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:36:25,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:25,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 106 [2022-02-20 20:36:25,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:25,127 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2022-02-20 20:36:25,128 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-02-20 20:36:25,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 100 events. 3/100 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 44. Up to 12 conditions per place. [2022-02-20 20:36:25,129 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 16 selfloop transitions, 5 changer transitions 7/85 dead transitions. [2022-02-20 20:36:25,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 85 transitions, 256 flow [2022-02-20 20:36:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:36:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:36:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 549 transitions. [2022-02-20 20:36:25,134 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7398921832884097 [2022-02-20 20:36:25,134 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 549 transitions. [2022-02-20 20:36:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 549 transitions. [2022-02-20 20:36:25,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:25,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 549 transitions. [2022-02-20 20:36:25,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.42857142857143) internal successors, (549), 7 states have internal predecessors, (549), 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:36:25,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 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:36:25,137 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 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:36:25,137 INFO L186 Difference]: Start difference. First operand has 92 places, 85 transitions, 202 flow. Second operand 7 states and 549 transitions. [2022-02-20 20:36:25,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 85 transitions, 256 flow [2022-02-20 20:36:25,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 238 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-02-20 20:36:25,140 INFO L242 Difference]: Finished difference. Result has 91 places, 76 transitions, 174 flow [2022-02-20 20:36:25,140 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2022-02-20 20:36:25,140 INFO L334 CegarLoopForPetriNet]: 90 programPoint places, 1 predicate places. [2022-02-20 20:36:25,141 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 76 transitions, 174 flow [2022-02-20 20:36:25,144 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 180 states, 178 states have (on average 1.595505617977528) internal successors, (284), 179 states have internal predecessors, (284), 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:36:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 180 states, 178 states have (on average 1.595505617977528) internal successors, (284), 179 states have internal predecessors, (284), 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 44 [2022-02-20 20:36:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:25,144 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 174 flow [2022-02-20 20:36:25,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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:36:25,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:25,145 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:36:25,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:36:25,145 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:36:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 447259994, now seen corresponding path program 1 times [2022-02-20 20:36:25,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:25,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662256196] [2022-02-20 20:36:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:25,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#true} [250] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} [192] 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] {506#true} is VALID [2022-02-20 20:36:25,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} [254] 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[] {506#true} is VALID [2022-02-20 20:36:25,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#true} [257] L-1-2-->L1693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#true} [239] L1693-->L1693-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[] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} [253] L1693-1-->L1693-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[] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#true} [224] L1693-2-->L1693-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[] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#true} [202] L1693-3-->L1693-4: Formula: (and (= 16 (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[] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#true} [251] L1693-4-->L1696: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {506#true} is VALID [2022-02-20 20:36:25,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#true} [188] L1696-->L1696-1: Formula: (and (= (select |v_#valid_4| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {506#true} [189] L1696-1-->L1696-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#true} [172] L1696-2-->L1697: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {506#true} is VALID [2022-02-20 20:36:25,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#true} [190] L1697-->L1697-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[] {506#true} is VALID [2022-02-20 20:36:25,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#true} [199] L1697-1-->L1697-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#true} [173] L1697-2-->L1697-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#true} [201] L1697-3-->L1697-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#true} [180] L1697-4-->L1697-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {506#true} [236] L1697-5-->L1697-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {506#true} [176] L1697-6-->L-1-3: Formula: (= v_~pdev~0_2 0) InVars {} OutVars{~pdev~0=v_~pdev~0_2} AuxVars[] AssignedVars[~pdev~0] {506#true} is VALID [2022-02-20 20:36:25,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {506#true} [258] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {506#true} [195] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {506#true} [174] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {506#true} is VALID [2022-02-20 20:36:25,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {506#true} [242] L-1-6-->L1734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {506#true} is VALID [2022-02-20 20:36:25,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {506#true} [235] L1734-->L1734-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {506#true} [223] L1734-1-->L1734-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {506#true} is VALID [2022-02-20 20:36:25,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {506#true} [161] L1734-2-->L1708: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {506#true} is VALID [2022-02-20 20:36:25,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {506#true} [179] L1708-->L1709: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {506#true} is VALID [2022-02-20 20:36:25,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {506#true} [229] L1709-->L1710: Formula: (= v_~pdev~0_3 1) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {506#true} is VALID [2022-02-20 20:36:25,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {506#true} [231] L1710-->L1710-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {506#true} [204] L1710-1-->L1710-2: Formula: (= (ite (= v_~pdev~0_4 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_4} OutVars{~pdev~0=v_~pdev~0_4, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {506#true} is VALID [2022-02-20 20:36:25,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {506#true} [218] L1710-2-->L1695: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {506#true} is VALID [2022-02-20 20:36:25,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {506#true} [238] L1695-->L1695-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_2| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {506#true} is VALID [2022-02-20 20:36:25,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {506#true} [160] L1695-1-->L1695-5: Formula: (not (= |v_ULTIMATE.start_ldv_assert_~expression#1_4| 0)) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {506#true} [187] L1695-5-->L1711: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {506#true} [248] L1711-->L1711-1: Formula: (and (<= |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483648))) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {506#true} [193] L1711-1-->L1711-2: Formula: (not (= |v_ULTIMATE.start_module_init_#t~nondet32#1_3| 0)) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} AuxVars[] AssignedVars[] {506#true} is VALID [2022-02-20 20:36:25,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {506#true} [206] L1711-2-->L1712: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1] {506#true} is VALID [2022-02-20 20:36:25,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {506#true} [170] L1712-->L1712-1: Formula: (= |v_ULTIMATE.start_module_init_#t~pre33#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~pre33#1] {506#true} is VALID [2022-02-20 20:36:25,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {506#true} [162] L1712-1-->L1712-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {506#true} is VALID [2022-02-20 20:36:25,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {506#true} [225] L1712-2-->L1712-3: Formula: (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.offset_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|)))) (= (store |v_#memory_int_10| |v_~#t1~0.base_3| (store (select |v_#memory_int_10| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| |v_ULTIMATE.start_module_init_#t~pre33#1_3|)) |v_#memory_int_9|) (= (store |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.base_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|))) |v_#memory_$Pointer$.base_1|)) InVars {~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_10|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|} OutVars{~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_9|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] {506#true} is VALID [2022-02-20 20:36:25,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {506#true} [271] L1712-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_module_init_#t~pre33#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|} OutVars{thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_4, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_4, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_4|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#in~arg.base, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#in~arg.offset, thread1Thread1of1ForFork0_#t~nondet31] {506#true} is VALID [2022-02-20 20:36:25,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {506#true} [166] L1712-4-->L1712-5: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~pre33#1] {506#true} is VALID [2022-02-20 20:36:25,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {506#true} [177] L1712-5-->L1713: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet34#1] {506#true} is VALID [2022-02-20 20:36:25,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {506#true} [197] L1713-->L1715: Formula: (= 2 v_~pdev~0_5) InVars {} OutVars{~pdev~0=v_~pdev~0_5} AuxVars[] AssignedVars[~pdev~0] {508#(= ~pdev~0 2)} is VALID [2022-02-20 20:36:25,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {508#(= ~pdev~0 2)} [182] L1715-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_#in~expression#1_15| (ite (= 2 v_~pdev~0_15) 1 0)) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_15|)) InVars {~pdev~0=v_~pdev~0_15} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_15, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] {507#false} is VALID [2022-02-20 20:36:25,245 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:36:25,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:25,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662256196] [2022-02-20 20:36:25,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662256196] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:25,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:25,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:36:25,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955597690] [2022-02-20 20:36:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:36:25,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:25,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:36:25,272 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:36:25,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:36:25,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:36:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:36:25,275 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2022-02-20 20:36:25,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:36:25,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:25,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2022-02-20 20:36:25,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:25,321 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2022-02-20 20:36:25,321 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-02-20 20:36:25,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 100 events. 2/100 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 0 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 26. Up to 13 conditions per place. [2022-02-20 20:36:25,322 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 11 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2022-02-20 20:36:25,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 215 flow [2022-02-20 20:36:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:36:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:36:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-02-20 20:36:25,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8710691823899371 [2022-02-20 20:36:25,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-02-20 20:36:25,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-02-20 20:36:25,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:25,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-02-20 20:36:25,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:36:25,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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:36:25,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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:36:25,328 INFO L186 Difference]: Start difference. First operand has 91 places, 76 transitions, 174 flow. Second operand 3 states and 277 transitions. [2022-02-20 20:36:25,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 215 flow [2022-02-20 20:36:25,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 203 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:36:25,330 INFO L242 Difference]: Finished difference. Result has 82 places, 78 transitions, 194 flow [2022-02-20 20:36:25,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2022-02-20 20:36:25,331 INFO L334 CegarLoopForPetriNet]: 90 programPoint places, -8 predicate places. [2022-02-20 20:36:25,331 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 78 transitions, 194 flow [2022-02-20 20:36:25,334 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 228 states, 226 states have (on average 1.5973451327433628) internal successors, (361), 227 states have internal predecessors, (361), 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:36:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 228 states, 226 states have (on average 1.5973451327433628) internal successors, (361), 227 states have internal predecessors, (361), 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:36:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:25,335 INFO L470 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 194 flow [2022-02-20 20:36:25,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:36:25,336 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:25,336 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] [2022-02-20 20:36:25,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:36:25,336 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:36:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1791891516, now seen corresponding path program 1 times [2022-02-20 20:36:25,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:25,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657958014] [2022-02-20 20:36:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:25,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:36:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:36:25,383 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:36:25,383 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:36:25,384 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-20 20:36:25,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:36:25,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-02-20 20:36:25,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-02-20 20:36:25,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 5 remaining) [2022-02-20 20:36:25,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:36:25,388 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:36:25,390 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:36:25,391 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:36:25,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:36:25 BasicIcfg [2022-02-20 20:36:25,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:36:25,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:36:25,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:36:25,413 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:36:25,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:24" (3/4) ... [2022-02-20 20:36:25,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:36:25,441 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:36:25,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:36:25,442 INFO L158 Benchmark]: Toolchain (without parser) took 2456.31ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 65.7MB in the beginning and 79.8MB in the end (delta: -14.0MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,443 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:36:25,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.31ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.6MB in the beginning and 90.1MB in the end (delta: -24.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 86.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,443 INFO L158 Benchmark]: Boogie Preprocessor took 49.70ms. Allocated memory is still 132.1MB. Free memory was 86.8MB in the beginning and 83.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,444 INFO L158 Benchmark]: RCFGBuilder took 404.95ms. Allocated memory is still 132.1MB. Free memory was 83.8MB in the beginning and 63.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,444 INFO L158 Benchmark]: TraceAbstraction took 1312.88ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 63.5MB in the beginning and 85.0MB in the end (delta: -21.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,444 INFO L158 Benchmark]: Witness Printer took 28.72ms. Allocated memory is still 161.5MB. Free memory was 85.0MB in the beginning and 79.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:25,446 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.14ms. Allocated memory is still 109.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.31ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.6MB in the beginning and 90.1MB in the end (delta: -24.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 86.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.70ms. Allocated memory is still 132.1MB. Free memory was 86.8MB in the beginning and 83.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 404.95ms. Allocated memory is still 132.1MB. Free memory was 83.8MB in the beginning and 63.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1312.88ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 63.5MB in the beginning and 85.0MB in the end (delta: -21.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 28.72ms. Allocated memory is still 161.5MB. Free memory was 85.0MB in the beginning and 79.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; VAL [t1={3:0}] [L1697] 0 pthread_mutex_t mutex; VAL [mutex={4:0}, t1={3:0}] [L1698] 0 int pdev; VAL [mutex={4:0}, pdev=0, t1={3:0}] [L1734] CALL 0 module_init() [L1709] 0 pdev = 1 VAL [mutex={4:0}, pdev=1, t1={3:0}] [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1710] RET 0 ldv_assert(pdev==1) [L1711] COND TRUE 0 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, mutex={4:0}, pdev=1, t1={3:0}] [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, pthread_create(&t1, ((void *)0), thread1, ((void *)0))=-1, t1={3:0}] [L1714] 0 pdev = 2 VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=2, t1={3:0}] [L1702] 1 pdev = 6 VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=6, t1={3:0}] [L1717] CALL 0 ldv_assert(pdev==2) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 40 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred 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.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:36:25,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE